/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-05 23:54:45,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-05 23:54:45,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-05 23:54:45,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-05 23:54:45,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-05 23:54:45,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-05 23:54:45,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-05 23:54:45,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-05 23:54:45,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-05 23:54:45,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-05 23:54:45,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-05 23:54:45,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-05 23:54:45,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-05 23:54:45,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-05 23:54:45,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-05 23:54:45,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-05 23:54:45,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-05 23:54:45,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-05 23:54:45,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-05 23:54:45,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-05 23:54:45,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-05 23:54:45,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-05 23:54:45,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-05 23:54:45,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-05 23:54:45,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-05 23:54:45,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-05 23:54:45,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-05 23:54:45,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-05 23:54:45,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-05 23:54:45,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-05 23:54:45,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-05 23:54:45,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-05 23:54:45,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-05 23:54:45,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-05 23:54:45,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-05 23:54:45,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-05 23:54:45,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-05 23:54:45,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-05 23:54:45,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-05 23:54:45,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-05 23:54:45,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-05 23:54:45,475 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-05 23:54:45,504 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-05 23:54:45,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-05 23:54:45,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-05 23:54:45,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-05 23:54:45,507 INFO L138 SettingsManager]: * Use SBE=true [2021-05-05 23:54:45,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-05 23:54:45,507 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-05 23:54:45,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-05 23:54:45,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-05 23:54:45,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-05 23:54:45,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-05 23:54:45,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-05 23:54:45,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-05 23:54:45,508 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-05 23:54:45,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-05 23:54:45,508 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-05 23:54:45,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-05 23:54:45,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-05 23:54:45,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-05 23:54:45,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-05 23:54:45,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-05 23:54:45,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-05 23:54:45,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-05 23:54:45,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-05 23:54:45,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-05 23:54:45,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-05 23:54:45,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-05 23:54:45,509 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-05 23:54:45,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-05 23:54:45,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-05 23:54:45,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-05 23:54:45,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-05 23:54:45,766 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-05 23:54:45,767 INFO L275 PluginConnector]: CDTParser initialized [2021-05-05 23:54:45,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-05-05 23:54:45,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc8b25f4/360dbca14ca945fa99b0a5a446e69875/FLAG183457a67 [2021-05-05 23:54:46,385 INFO L306 CDTParser]: Found 1 translation units. [2021-05-05 23:54:46,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-05-05 23:54:46,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc8b25f4/360dbca14ca945fa99b0a5a446e69875/FLAG183457a67 [2021-05-05 23:54:46,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc8b25f4/360dbca14ca945fa99b0a5a446e69875 [2021-05-05 23:54:46,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-05 23:54:46,605 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-05 23:54:46,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-05 23:54:46,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-05 23:54:46,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-05 23:54:46,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:54:46" (1/1) ... [2021-05-05 23:54:46,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@330a6a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46, skipping insertion in model container [2021-05-05 23:54:46,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:54:46" (1/1) ... [2021-05-05 23:54:46,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-05 23:54:46,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-05 23:54:46,788 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-05-05 23:54:46,791 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-05-05 23:54:46,792 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-05-05 23:54:46,793 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-05-05 23:54:46,794 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-05-05 23:54:46,795 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-05-05 23:54:46,796 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-05-05 23:54:46,797 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-05-05 23:54:46,799 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-05-05 23:54:46,800 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-05-05 23:54:46,801 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-05-05 23:54:46,802 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-05-05 23:54:46,804 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-05-05 23:54:46,806 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-05-05 23:54:46,807 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-05-05 23:54:46,808 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-05-05 23:54:46,810 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-05-05 23:54:46,810 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-05-05 23:54:46,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-05 23:54:46,824 INFO L203 MainTranslator]: Completed pre-run [2021-05-05 23:54:46,834 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-05-05 23:54:46,852 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-05-05 23:54:46,853 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-05-05 23:54:46,853 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-05-05 23:54:46,854 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-05-05 23:54:46,855 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-05-05 23:54:46,856 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-05-05 23:54:46,857 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-05-05 23:54:46,859 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-05-05 23:54:46,860 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-05-05 23:54:46,861 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-05-05 23:54:46,861 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-05-05 23:54:46,862 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-05-05 23:54:46,863 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-05-05 23:54:46,864 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-05-05 23:54:46,868 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-05-05 23:54:46,877 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-05-05 23:54:46,889 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-05-05 23:54:46,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-05 23:54:46,899 INFO L208 MainTranslator]: Completed translation [2021-05-05 23:54:46,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46 WrapperNode [2021-05-05 23:54:46,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-05 23:54:46,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-05 23:54:46,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-05 23:54:46,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-05 23:54:46,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46" (1/1) ... [2021-05-05 23:54:46,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46" (1/1) ... [2021-05-05 23:54:46,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46" (1/1) ... [2021-05-05 23:54:46,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46" (1/1) ... [2021-05-05 23:54:46,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46" (1/1) ... [2021-05-05 23:54:46,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46" (1/1) ... [2021-05-05 23:54:46,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46" (1/1) ... [2021-05-05 23:54:46,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-05 23:54:46,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-05 23:54:46,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-05 23:54:46,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-05 23:54:46,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-05 23:54:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-05 23:54:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-05 23:54:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-05 23:54:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-05 23:54:47,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-05 23:54:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-05 23:54:47,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-05 23:54:47,297 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-05 23:54:47,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:54:47 BoogieIcfgContainer [2021-05-05 23:54:47,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-05 23:54:47,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-05 23:54:47,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-05 23:54:47,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-05 23:54:47,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 11:54:46" (1/3) ... [2021-05-05 23:54:47,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5500f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:54:47, skipping insertion in model container [2021-05-05 23:54:47,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:46" (2/3) ... [2021-05-05 23:54:47,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5500f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:54:47, skipping insertion in model container [2021-05-05 23:54:47,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:54:47" (3/3) ... [2021-05-05 23:54:47,305 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2021-05-05 23:54:47,308 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-05 23:54:47,311 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2021-05-05 23:54:47,321 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-05-05 23:54:47,336 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-05 23:54:47,336 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-05 23:54:47,336 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-05 23:54:47,337 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-05 23:54:47,337 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-05 23:54:47,337 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-05 23:54:47,337 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-05 23:54:47,337 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-05 23:54:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-05 23:54:47,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-05 23:54:47,354 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:47,354 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:47,355 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:47,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2021-05-05 23:54:47,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:47,364 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642258357] [2021-05-05 23:54:47,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:47,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:47,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:47,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642258357] [2021-05-05 23:54:47,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642258357] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:47,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:47,548 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-05 23:54:47,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802804450] [2021-05-05 23:54:47,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-05 23:54:47,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:47,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-05 23:54:47,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-05 23:54:47,560 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:47,644 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2021-05-05 23:54:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-05 23:54:47,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-05 23:54:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:47,650 INFO L225 Difference]: With dead ends: 93 [2021-05-05 23:54:47,650 INFO L226 Difference]: Without dead ends: 80 [2021-05-05 23:54:47,652 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-05 23:54:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-05-05 23:54:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-05-05 23:54:47,677 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2021-05-05 23:54:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:47,677 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-05-05 23:54:47,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-05-05 23:54:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-05 23:54:47,678 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:47,678 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:47,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-05 23:54:47,678 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:47,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:47,679 INFO L82 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2021-05-05 23:54:47,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:47,679 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827002939] [2021-05-05 23:54:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:47,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:47,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:47,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827002939] [2021-05-05 23:54:47,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827002939] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:47,754 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:47,754 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:54:47,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181117305] [2021-05-05 23:54:47,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:47,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:47,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:47,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:47,756 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:47,941 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-05-05 23:54:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:47,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-05 23:54:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:47,944 INFO L225 Difference]: With dead ends: 80 [2021-05-05 23:54:47,945 INFO L226 Difference]: Without dead ends: 78 [2021-05-05 23:54:47,947 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 135.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-05 23:54:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-05-05 23:54:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-05-05 23:54:47,967 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2021-05-05 23:54:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:47,967 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-05-05 23:54:47,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-05-05 23:54:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-05 23:54:47,967 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:47,968 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:47,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-05 23:54:47,968 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:47,969 INFO L82 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2021-05-05 23:54:47,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:47,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891234053] [2021-05-05 23:54:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:48,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:48,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:48,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891234053] [2021-05-05 23:54:48,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891234053] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:48,044 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:48,044 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-05 23:54:48,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585846699] [2021-05-05 23:54:48,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-05 23:54:48,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:48,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-05 23:54:48,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:48,045 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:48,229 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-05-05 23:54:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:48,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-05 23:54:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:48,230 INFO L225 Difference]: With dead ends: 101 [2021-05-05 23:54:48,230 INFO L226 Difference]: Without dead ends: 99 [2021-05-05 23:54:48,231 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 103.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-05 23:54:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-05 23:54:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2021-05-05 23:54:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-05-05 23:54:48,235 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2021-05-05 23:54:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:48,235 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-05-05 23:54:48,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-05-05 23:54:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-05 23:54:48,236 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:48,236 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:48,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-05 23:54:48,236 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:48,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:48,237 INFO L82 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2021-05-05 23:54:48,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:48,237 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447727345] [2021-05-05 23:54:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:48,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:48,290 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:48,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447727345] [2021-05-05 23:54:48,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447727345] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:48,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:48,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:48,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489080752] [2021-05-05 23:54:48,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:48,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:48,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:48,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:48,292 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:48,418 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-05 23:54:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:48,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-05 23:54:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:48,419 INFO L225 Difference]: With dead ends: 76 [2021-05-05 23:54:48,419 INFO L226 Difference]: Without dead ends: 74 [2021-05-05 23:54:48,419 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 93.8ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-05 23:54:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-05-05 23:54:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-05-05 23:54:48,423 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2021-05-05 23:54:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:48,423 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-05-05 23:54:48,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-05-05 23:54:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-05 23:54:48,424 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:48,424 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:48,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-05 23:54:48,424 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2021-05-05 23:54:48,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:48,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250150608] [2021-05-05 23:54:48,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:48,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:48,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:48,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250150608] [2021-05-05 23:54:48,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250150608] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:48,483 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:48,483 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:48,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755783120] [2021-05-05 23:54:48,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:48,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:48,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:48,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:48,484 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:48,846 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2021-05-05 23:54:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-05 23:54:48,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-05-05 23:54:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:48,848 INFO L225 Difference]: With dead ends: 141 [2021-05-05 23:54:48,848 INFO L226 Difference]: Without dead ends: 139 [2021-05-05 23:54:48,848 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 179.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-05 23:54:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2021-05-05 23:54:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-05 23:54:48,853 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2021-05-05 23:54:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:48,853 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-05 23:54:48,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-05 23:54:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-05 23:54:48,853 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:48,854 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:48,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-05 23:54:48,854 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2021-05-05 23:54:48,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:48,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209202908] [2021-05-05 23:54:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:48,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:48,916 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:48,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209202908] [2021-05-05 23:54:48,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209202908] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:48,916 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:48,917 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:48,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90223746] [2021-05-05 23:54:48,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:48,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:48,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:48,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:48,917 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:49,232 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-05-05 23:54:49,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-05 23:54:49,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-05-05 23:54:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:49,233 INFO L225 Difference]: With dead ends: 108 [2021-05-05 23:54:49,233 INFO L226 Difference]: Without dead ends: 106 [2021-05-05 23:54:49,234 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 174.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-05-05 23:54:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2021-05-05 23:54:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2021-05-05 23:54:49,238 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2021-05-05 23:54:49,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:49,238 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2021-05-05 23:54:49,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2021-05-05 23:54:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-05 23:54:49,239 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:49,239 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:49,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-05 23:54:49,239 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:49,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2021-05-05 23:54:49,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:49,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455031640] [2021-05-05 23:54:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:49,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:49,289 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:49,289 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455031640] [2021-05-05 23:54:49,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455031640] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:49,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:49,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:49,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178457546] [2021-05-05 23:54:49,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:49,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:49,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:49,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:49,290 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:49,550 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2021-05-05 23:54:49,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:49,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-05-05 23:54:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:49,552 INFO L225 Difference]: With dead ends: 121 [2021-05-05 23:54:49,552 INFO L226 Difference]: Without dead ends: 119 [2021-05-05 23:54:49,552 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 138.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-05 23:54:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2021-05-05 23:54:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-05 23:54:49,556 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2021-05-05 23:54:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:49,556 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-05 23:54:49,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-05 23:54:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-05 23:54:49,556 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:49,557 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:49,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-05 23:54:49,557 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2021-05-05 23:54:49,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:49,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768993422] [2021-05-05 23:54:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:49,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:49,609 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:49,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768993422] [2021-05-05 23:54:49,609 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768993422] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:49,609 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:49,609 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:49,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519134753] [2021-05-05 23:54:49,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:49,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:49,610 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:49,780 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2021-05-05 23:54:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:49,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-05-05 23:54:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:49,784 INFO L225 Difference]: With dead ends: 77 [2021-05-05 23:54:49,784 INFO L226 Difference]: Without dead ends: 75 [2021-05-05 23:54:49,785 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 132.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-05 23:54:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-05 23:54:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-05-05 23:54:49,788 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2021-05-05 23:54:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:49,788 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-05-05 23:54:49,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-05-05 23:54:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-05 23:54:49,789 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:49,789 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:49,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-05 23:54:49,789 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:49,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2021-05-05 23:54:49,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:49,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803741964] [2021-05-05 23:54:49,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:49,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:49,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:49,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803741964] [2021-05-05 23:54:49,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803741964] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:49,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:49,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-05 23:54:49,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951382953] [2021-05-05 23:54:49,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-05 23:54:49,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:49,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-05 23:54:49,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-05 23:54:49,829 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:49,925 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-05-05 23:54:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-05 23:54:49,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-05 23:54:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:49,926 INFO L225 Difference]: With dead ends: 115 [2021-05-05 23:54:49,926 INFO L226 Difference]: Without dead ends: 75 [2021-05-05 23:54:49,926 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-05 23:54:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-05 23:54:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-05-05 23:54:49,929 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2021-05-05 23:54:49,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:49,929 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-05-05 23:54:49,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-05-05 23:54:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-05 23:54:49,930 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:49,930 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:49,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-05 23:54:49,930 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:49,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:49,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2021-05-05 23:54:49,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:49,931 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408121342] [2021-05-05 23:54:49,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:49,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:49,983 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:49,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408121342] [2021-05-05 23:54:49,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408121342] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:49,983 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:49,983 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:49,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990745993] [2021-05-05 23:54:49,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:49,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:49,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:49,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:49,985 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:50,151 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-05 23:54:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:50,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-05-05 23:54:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:50,152 INFO L225 Difference]: With dead ends: 76 [2021-05-05 23:54:50,152 INFO L226 Difference]: Without dead ends: 74 [2021-05-05 23:54:50,152 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 119.0ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-05 23:54:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-05 23:54:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-05 23:54:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-05-05 23:54:50,155 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2021-05-05 23:54:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:50,156 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-05-05 23:54:50,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-05-05 23:54:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-05 23:54:50,156 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:50,156 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:50,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-05 23:54:50,157 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2021-05-05 23:54:50,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:50,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001964677] [2021-05-05 23:54:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:50,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-05 23:54:50,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:50,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001964677] [2021-05-05 23:54:50,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001964677] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-05 23:54:50,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888626773] [2021-05-05 23:54:50,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-05 23:54:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:50,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-05 23:54:50,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-05 23:54:50,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:50,390 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:50,392 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:50,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-05 23:54:50,432 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888626773] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-05 23:54:50,432 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-05 23:54:50,432 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-05-05 23:54:50,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339614118] [2021-05-05 23:54:50,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:50,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:50,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:50,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:50,433 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:50,646 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-05-05 23:54:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:50,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-05-05 23:54:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:50,648 INFO L225 Difference]: With dead ends: 111 [2021-05-05 23:54:50,648 INFO L226 Difference]: Without dead ends: 109 [2021-05-05 23:54:50,649 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 111.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-05 23:54:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2021-05-05 23:54:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-05-05 23:54:50,655 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2021-05-05 23:54:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:50,656 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-05-05 23:54:50,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-05-05 23:54:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-05 23:54:50,657 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:50,657 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:50,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-05-05 23:54:50,869 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2021-05-05 23:54:50,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:50,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95064420] [2021-05-05 23:54:50,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:50,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:50,915 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:50,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95064420] [2021-05-05 23:54:50,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95064420] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:50,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:50,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:50,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870346620] [2021-05-05 23:54:50,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:50,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:50,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:50,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:50,916 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:51,041 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-05 23:54:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:51,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-05 23:54:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:51,041 INFO L225 Difference]: With dead ends: 70 [2021-05-05 23:54:51,042 INFO L226 Difference]: Without dead ends: 68 [2021-05-05 23:54:51,042 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 86.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-05 23:54:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-05-05 23:54:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-05-05 23:54:51,055 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2021-05-05 23:54:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:51,056 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-05-05 23:54:51,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-05-05 23:54:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-05 23:54:51,060 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:51,061 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:51,061 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-05 23:54:51,061 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:51,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:51,061 INFO L82 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2021-05-05 23:54:51,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:51,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314394656] [2021-05-05 23:54:51,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:51,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-05 23:54:51,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:51,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314394656] [2021-05-05 23:54:51,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314394656] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-05 23:54:51,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7392018] [2021-05-05 23:54:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-05 23:54:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:51,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjunts are in the unsatisfiable core [2021-05-05 23:54:51,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-05 23:54:51,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:51,244 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:51,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:51,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-05 23:54:51,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7392018] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-05 23:54:51,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-05 23:54:51,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-05-05 23:54:51,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58444237] [2021-05-05 23:54:51,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:51,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:51,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:51,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:51,288 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:51,430 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-05-05 23:54:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:51,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-05 23:54:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:51,430 INFO L225 Difference]: With dead ends: 69 [2021-05-05 23:54:51,430 INFO L226 Difference]: Without dead ends: 67 [2021-05-05 23:54:51,431 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 113.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-05 23:54:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2021-05-05 23:54:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2021-05-05 23:54:51,433 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2021-05-05 23:54:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:51,434 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-05-05 23:54:51,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2021-05-05 23:54:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-05 23:54:51,434 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:51,434 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:51,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-05-05 23:54:51,649 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2021-05-05 23:54:51,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:51,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360895564] [2021-05-05 23:54:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:51,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:51,698 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:51,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360895564] [2021-05-05 23:54:51,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360895564] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:51,698 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:51,698 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:51,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640094018] [2021-05-05 23:54:51,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:51,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:51,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:51,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:51,699 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:51,852 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-05-05 23:54:51,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:51,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-05-05 23:54:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:51,853 INFO L225 Difference]: With dead ends: 63 [2021-05-05 23:54:51,853 INFO L226 Difference]: Without dead ends: 61 [2021-05-05 23:54:51,853 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 112.3ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-05 23:54:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-05 23:54:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2021-05-05 23:54:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-05-05 23:54:51,856 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2021-05-05 23:54:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:51,856 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-05-05 23:54:51,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-05-05 23:54:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-05 23:54:51,856 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:51,856 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:51,856 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-05 23:54:51,856 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2021-05-05 23:54:51,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:51,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606772719] [2021-05-05 23:54:51,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:51,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:51,902 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:51,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606772719] [2021-05-05 23:54:51,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606772719] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:51,902 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:51,902 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:54:51,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018268603] [2021-05-05 23:54:51,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:51,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:51,903 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:52,052 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2021-05-05 23:54:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:52,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-05-05 23:54:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:52,052 INFO L225 Difference]: With dead ends: 71 [2021-05-05 23:54:52,052 INFO L226 Difference]: Without dead ends: 69 [2021-05-05 23:54:52,053 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 96.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-05 23:54:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2021-05-05 23:54:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-05-05 23:54:52,055 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2021-05-05 23:54:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:52,056 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-05-05 23:54:52,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-05-05 23:54:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-05 23:54:52,056 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:52,056 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:52,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-05 23:54:52,056 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:52,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2021-05-05 23:54:52,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:52,057 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87246661] [2021-05-05 23:54:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:52,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:52,104 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:52,104 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87246661] [2021-05-05 23:54:52,104 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87246661] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:52,104 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:52,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:52,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652869268] [2021-05-05 23:54:52,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:52,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:52,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:52,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:52,105 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:52,374 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-05-05 23:54:52,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-05 23:54:52,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-05-05 23:54:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:52,375 INFO L225 Difference]: With dead ends: 91 [2021-05-05 23:54:52,375 INFO L226 Difference]: Without dead ends: 89 [2021-05-05 23:54:52,375 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 173.1ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-05 23:54:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2021-05-05 23:54:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-05-05 23:54:52,383 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2021-05-05 23:54:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:52,383 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-05-05 23:54:52,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,383 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2021-05-05 23:54:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-05 23:54:52,384 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:52,384 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:52,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-05 23:54:52,384 INFO L428 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:52,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:52,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2021-05-05 23:54:52,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:52,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969333261] [2021-05-05 23:54:52,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:52,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:52,457 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:52,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969333261] [2021-05-05 23:54:52,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969333261] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:52,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:52,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:52,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622786722] [2021-05-05 23:54:52,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:52,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:52,459 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:52,620 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-05-05 23:54:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-05-05 23:54:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:52,621 INFO L225 Difference]: With dead ends: 61 [2021-05-05 23:54:52,621 INFO L226 Difference]: Without dead ends: 59 [2021-05-05 23:54:52,621 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 131.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-05 23:54:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-05 23:54:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2021-05-05 23:54:52,624 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2021-05-05 23:54:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:52,624 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-05-05 23:54:52,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2021-05-05 23:54:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-05 23:54:52,624 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:52,624 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:52,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-05 23:54:52,625 INFO L428 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:52,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2021-05-05 23:54:52,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:52,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708409924] [2021-05-05 23:54:52,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:52,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:52,660 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:52,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708409924] [2021-05-05 23:54:52,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708409924] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:52,661 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:52,661 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-05 23:54:52,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235506206] [2021-05-05 23:54:52,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-05 23:54:52,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:52,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-05 23:54:52,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:52,661 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:52,792 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-05 23:54:52,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:52,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-05-05 23:54:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:52,793 INFO L225 Difference]: With dead ends: 70 [2021-05-05 23:54:52,793 INFO L226 Difference]: Without dead ends: 68 [2021-05-05 23:54:52,793 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 70.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-05 23:54:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-05 23:54:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2021-05-05 23:54:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-05-05 23:54:52,797 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2021-05-05 23:54:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:52,797 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-05-05 23:54:52,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-05-05 23:54:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-05-05 23:54:52,797 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:52,797 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:52,797 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-05 23:54:52,797 INFO L428 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:52,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2021-05-05 23:54:52,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:52,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193101651] [2021-05-05 23:54:52,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:52,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:52,839 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:52,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193101651] [2021-05-05 23:54:52,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193101651] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:52,839 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:52,839 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:52,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377924463] [2021-05-05 23:54:52,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:52,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:52,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:52,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:52,840 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:52,994 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-05-05 23:54:52,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:52,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2021-05-05 23:54:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:52,996 INFO L225 Difference]: With dead ends: 66 [2021-05-05 23:54:52,996 INFO L226 Difference]: Without dead ends: 64 [2021-05-05 23:54:52,996 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 81.5ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-05 23:54:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2021-05-05 23:54:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-05-05 23:54:53,000 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2021-05-05 23:54:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:53,000 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-05-05 23:54:53,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-05-05 23:54:53,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-05 23:54:53,000 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:53,001 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:53,001 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-05 23:54:53,001 INFO L428 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:53,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:53,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2021-05-05 23:54:53,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:53,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284905294] [2021-05-05 23:54:53,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:53,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:53,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:53,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284905294] [2021-05-05 23:54:53,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284905294] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:53,060 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:53,060 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:53,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347380511] [2021-05-05 23:54:53,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:53,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:53,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:53,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:53,061 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:53,324 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2021-05-05 23:54:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-05 23:54:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-05-05 23:54:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:53,325 INFO L225 Difference]: With dead ends: 88 [2021-05-05 23:54:53,325 INFO L226 Difference]: Without dead ends: 86 [2021-05-05 23:54:53,325 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 171.4ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:53,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-05 23:54:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2021-05-05 23:54:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-05-05 23:54:53,328 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2021-05-05 23:54:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:53,328 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-05-05 23:54:53,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2021-05-05 23:54:53,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-05 23:54:53,328 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:53,328 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:53,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-05 23:54:53,329 INFO L428 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:53,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:53,329 INFO L82 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2021-05-05 23:54:53,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:53,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921545441] [2021-05-05 23:54:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:53,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:53,379 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:53,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921545441] [2021-05-05 23:54:53,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921545441] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-05 23:54:53,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338117706] [2021-05-05 23:54:53,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-05 23:54:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:53,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjunts are in the unsatisfiable core [2021-05-05 23:54:53,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-05 23:54:53,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:53,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:53,495 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:53,509 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:53,510 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:53,517 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-05 23:54:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:53,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338117706] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-05 23:54:53,528 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-05 23:54:53,528 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-05-05 23:54:53,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986192535] [2021-05-05 23:54:53,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:53,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:53,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:53,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:53,529 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:53,693 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2021-05-05 23:54:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-05-05 23:54:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:53,694 INFO L225 Difference]: With dead ends: 60 [2021-05-05 23:54:53,694 INFO L226 Difference]: Without dead ends: 58 [2021-05-05 23:54:53,694 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 112.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-05 23:54:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-05 23:54:53,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-05-05 23:54:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-05-05 23:54:53,697 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2021-05-05 23:54:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:53,697 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-05-05 23:54:53,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2021-05-05 23:54:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-05 23:54:53,698 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:53,698 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:53,913 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-05 23:54:53,914 INFO L428 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:53,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2021-05-05 23:54:53,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:53,914 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457625649] [2021-05-05 23:54:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:53,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:53,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:53,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457625649] [2021-05-05 23:54:53,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457625649] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:53,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:53,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:53,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290697471] [2021-05-05 23:54:53,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:53,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:53,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:53,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:53,991 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:54,188 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-05-05 23:54:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:54,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-05-05 23:54:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:54,189 INFO L225 Difference]: With dead ends: 69 [2021-05-05 23:54:54,189 INFO L226 Difference]: Without dead ends: 67 [2021-05-05 23:54:54,190 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 138.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-05 23:54:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2021-05-05 23:54:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-05-05 23:54:54,194 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2021-05-05 23:54:54,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:54,194 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-05-05 23:54:54,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-05-05 23:54:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-05 23:54:54,194 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:54,194 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:54,194 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-05 23:54:54,194 INFO L428 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:54,195 INFO L82 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2021-05-05 23:54:54,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:54,195 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301047947] [2021-05-05 23:54:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:54,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-05 23:54:54,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:54,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301047947] [2021-05-05 23:54:54,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301047947] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:54,245 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:54,245 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:54,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199523548] [2021-05-05 23:54:54,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:54,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:54,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:54,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:54,246 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:54,521 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2021-05-05 23:54:54,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-05 23:54:54,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-05-05 23:54:54,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:54,521 INFO L225 Difference]: With dead ends: 75 [2021-05-05 23:54:54,521 INFO L226 Difference]: Without dead ends: 0 [2021-05-05 23:54:54,523 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 203.8ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-05-05 23:54:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-05 23:54:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-05 23:54:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-05 23:54:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-05 23:54:54,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2021-05-05 23:54:54,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:54,525 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-05 23:54:54,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-05 23:54:54,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-05 23:54:54,525 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-05 23:54:54,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-05 23:54:54,689 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2021-05-05 23:54:55,106 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 73 [2021-05-05 23:54:55,233 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 30 [2021-05-05 23:54:55,527 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= ~__return_375~0 |old(~__return_375~0)|)) [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-05 23:54:55,644 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-05 23:54:55,644 INFO L198 CegarLoopUtils]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 13 439) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L374(line 374) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L85(line 85) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L308(line 308) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L143(lines 143 362) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L234(lines 234 338) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L135(lines 135 397) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L226(line 226) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L61(lines 61 427) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L284(line 284) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L53(lines 53 433) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L243(line 243) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L177(line 177) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L111(lines 111 405) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L194 CegarLoopUtils]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (< main_~main__cp~0 main_~main__urilen~0)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse4 .cse5 (<= 1 main_~__VERIFIER_assert__cond~16)) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L194(lines 194 354) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L384(lines 384 393) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L95(lines 95 412) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point L29(lines 29 437) no Hoare annotation was computed. [2021-05-05 23:54:55,645 INFO L198 CegarLoopUtils]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L194 CegarLoopUtils]: At program point L401(lines 131 402) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 13 439) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point L104(lines 104 411) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point L71(lines 71 416) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L194 CegarLoopUtils]: At program point L327(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse2 (< main_~main__cp~0 main_~main__urilen~0)) (.cse3 (< 0 main_~main__scheme~0)) (.cse4 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse5 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse8 (= main_~__VERIFIER_assert__cond~3 1)) (.cse9 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse10 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse11 (= main_~__VERIFIER_assert__cond~9 1)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse15))))) (or (and (= main_~main__c~0 0) .cse0) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0))) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point L294(lines 294 318) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point L162(lines 162 359) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point L63(lines 63 422) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point L253(lines 253 329) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point L187(lines 187 355) no Hoare annotation was computed. [2021-05-05 23:54:55,646 INFO L194 CegarLoopUtils]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-05 23:54:55,646 INFO L198 CegarLoopUtils]: For program point L212(lines 212 346) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L47(lines 47 434) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L270(lines 270 322) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L204(lines 204 353) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L262(lines 262 328) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L386(line 386) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L97(line 97) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L155(lines 155 360) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L23(lines 23 438) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L296(line 296) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L65(lines 65 417) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L255(line 255) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L189(line 189) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L123(lines 123 403) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L214(line 214) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L272(line 272) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L41(lines 41 435) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L157(line 157) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L372(lines 372 395) no Hoare annotation was computed. [2021-05-05 23:54:55,647 INFO L198 CegarLoopUtils]: For program point L83(lines 83 414) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point L306(lines 306 316) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point L224(lines 224 344) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point L59(lines 59 432) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L194 CegarLoopUtils]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse4 (< main_~main__cp~0 main_~main__urilen~0)) (.cse5 (< 0 main_~main__scheme~0)) (.cse6 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse9 (= main_~__VERIFIER_assert__cond~3 1)) (.cse2 (= main_~main__c~0 0)) (.cse0 (= |old(~__return_375~0)| ~__return_375~0)) (.cse10 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse11 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse12 (= main_~__VERIFIER_assert__cond~9 1)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 (let ((.cse1 (let ((.cse8 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse16) (and .cse3 .cse4 .cse5 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))))) (or (and .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0)) (and .cse2 .cse1))) (<= 1 main_~__VERIFIER_assert__cond~10)) (and (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse2 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= main_~__VERIFIER_assert__cond~8 1) .cse16))) [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point L282(lines 282 320) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point L241(lines 241 331) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point L175(lines 175 357) no Hoare annotation was computed. [2021-05-05 23:54:55,648 INFO L198 CegarLoopUtils]: For program point L35(lines 35 436) no Hoare annotation was computed. [2021-05-05 23:54:55,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 11:54:55 BoogieIcfgContainer [2021-05-05 23:54:55,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-05 23:54:55,664 INFO L168 Benchmark]: Toolchain (without parser) took 9058.69 ms. Allocated memory was 199.2 MB in the beginning and 375.4 MB in the end (delta: 176.2 MB). Free memory was 162.2 MB in the beginning and 227.6 MB in the end (delta: -65.4 MB). Peak memory consumption was 202.8 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:55,664 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 199.2 MB. Free memory is still 179.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-05 23:54:55,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.57 ms. Allocated memory is still 199.2 MB. Free memory was 162.0 MB in the beginning and 176.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 8.7 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:55,664 INFO L168 Benchmark]: Boogie Preprocessor took 46.70 ms. Allocated memory is still 199.2 MB. Free memory was 176.5 MB in the beginning and 174.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:55,664 INFO L168 Benchmark]: RCFGBuilder took 350.76 ms. Allocated memory is still 199.2 MB. Free memory was 174.4 MB in the beginning and 145.1 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:55,664 INFO L168 Benchmark]: TraceAbstraction took 8363.95 ms. Allocated memory was 199.2 MB in the beginning and 375.4 MB in the end (delta: 176.2 MB). Free memory was 144.5 MB in the beginning and 227.6 MB in the end (delta: -83.1 MB). Peak memory consumption was 185.3 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:55,664 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 199.2 MB. Free memory is still 179.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 293.57 ms. Allocated memory is still 199.2 MB. Free memory was 162.0 MB in the beginning and 176.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 8.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.70 ms. Allocated memory is still 199.2 MB. Free memory was 176.5 MB in the beginning and 174.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 350.76 ms. Allocated memory is still 199.2 MB. Free memory was 174.4 MB in the beginning and 145.1 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8363.95 ms. Allocated memory was 199.2 MB in the beginning and 375.4 MB in the end (delta: 176.2 MB). Free memory was 144.5 MB in the beginning and 227.6 MB in the end (delta: -83.1 MB). Peak memory consumption was 185.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 94 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7190.4ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 19.5ms, AutomataDifference: 4405.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1118.2ms, InitialAbstractionConstructionTime: 9.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1302 SDtfs, 3788 SDslu, 287 SDs, 0 SdLazy, 2586 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1577.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 171 SyntacticMatches, 11 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2790.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 121.5ms AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 16 NumberOfFragments, 737 HoareAnnotationTreeSize, 9 FomulaSimplifications, 819385 FormulaSimplificationTreeSizeReduction, 324.4ms HoareSimplificationTime, 9 FomulaSimplificationsInter, 219726 FormulaSimplificationTreeSizeReductionInter, 787.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 62.5ms SsaConstructionTime, 203.7ms SatisfiabilityAnalysisTime, 1460.7ms InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 2458 SizeOfPredicates, 12 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 9/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((\old(__return_375) == __return_375 && ((((((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c) || (main__c == 0 && (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)))))) && 1 <= __VERIFIER_assert__cond) || ((((((((((((((((main__cp + 1 < main__urilen && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && main__c == 0) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((main__cp < main__urilen && __VERIFIER_assert__cond == 1) && ((((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)))) && \old(__return_375) == __return_375 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && ((main__c == 0 && ((((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))))) && \old(__return_375) == __return_375 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((main__cp < main__urilen && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) || ((((((main__cp < main__urilen && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && \old(__return_375) == __return_375 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 RESULT: Ultimate proved your program to be correct! Received shutdown request...