/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 18:06:45,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 18:06:45,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 18:06:45,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 18:06:45,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 18:06:45,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 18:06:45,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 18:06:45,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 18:06:45,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 18:06:45,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 18:06:45,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 18:06:45,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 18:06:45,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 18:06:45,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 18:06:45,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 18:06:45,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 18:06:45,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 18:06:45,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 18:06:45,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 18:06:45,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 18:06:45,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 18:06:45,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 18:06:45,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 18:06:45,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 18:06:45,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 18:06:45,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 18:06:45,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 18:06:45,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 18:06:45,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 18:06:45,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 18:06:45,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 18:06:45,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 18:06:45,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 18:06:45,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 18:06:45,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 18:06:45,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 18:06:45,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 18:06:45,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 18:06:45,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 18:06:45,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 18:06:45,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 18:06:45,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-02 18:06:45,685 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 18:06:45,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 18:06:45,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 18:06:45,687 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 18:06:45,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 18:06:45,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 18:06:45,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 18:06:45,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 18:06:45,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 18:06:45,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 18:06:45,688 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 18:06:45,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 18:06:45,688 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 18:06:45,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 18:06:45,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 18:06:45,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 18:06:45,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 18:06:45,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 18:06:45,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 18:06:45,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 18:06:45,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 18:06:45,690 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-02 18:06:45,691 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 18:06:45,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 18:06:45,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 18:06:45,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 18:06:45,959 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 18:06:45,960 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 18:06:45,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-02 18:06:46,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fadcaf935/628557bc28be4c73b86575597f6b2d53/FLAG3cd7ff506 [2021-05-02 18:06:46,365 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 18:06:46,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-02 18:06:46,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fadcaf935/628557bc28be4c73b86575597f6b2d53/FLAG3cd7ff506 [2021-05-02 18:06:46,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fadcaf935/628557bc28be4c73b86575597f6b2d53 [2021-05-02 18:06:46,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 18:06:46,773 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-02 18:06:46,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 18:06:46,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 18:06:46,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 18:06:46,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 06:06:46" (1/1) ... [2021-05-02 18:06:46,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a76bb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:46, skipping insertion in model container [2021-05-02 18:06:46,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 06:06:46" (1/1) ... [2021-05-02 18:06:46,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 18:06:46,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 18:06:46,910 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/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-02 18:06:46,916 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/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-02 18:06:46,920 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/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-02 18:06:46,925 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/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-05-02 18:06:46,926 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/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-05-02 18:06:46,927 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/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-05-02 18:06:46,929 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/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-05-02 18:06:46,930 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/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-05-02 18:06:46,931 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/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-05-02 18:06:46,931 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/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-05-02 18:06:46,933 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/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-05-02 18:06:46,937 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/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-05-02 18:06:46,937 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/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-05-02 18:06:46,938 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/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-05-02 18:06:46,940 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/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-05-02 18:06:46,940 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/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-05-02 18:06:46,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 18:06:46,948 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 18:06:46,987 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/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-02 18:06:46,994 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/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-02 18:06:46,997 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/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-02 18:06:47,005 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/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-05-02 18:06:47,006 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/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-05-02 18:06:47,007 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/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-05-02 18:06:47,008 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/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-05-02 18:06:47,009 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/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-05-02 18:06:47,009 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/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-05-02 18:06:47,010 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/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-05-02 18:06:47,011 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/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-05-02 18:06:47,011 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/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-05-02 18:06:47,012 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/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-05-02 18:06:47,013 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/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-05-02 18:06:47,014 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/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-05-02 18:06:47,015 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/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-05-02 18:06:47,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 18:06:47,030 INFO L208 MainTranslator]: Completed translation [2021-05-02 18:06:47,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:47 WrapperNode [2021-05-02 18:06:47,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 18:06:47,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 18:06:47,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 18:06:47,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 18:06:47,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:47" (1/1) ... [2021-05-02 18:06:47,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:47" (1/1) ... [2021-05-02 18:06:47,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:47" (1/1) ... [2021-05-02 18:06:47,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:47" (1/1) ... [2021-05-02 18:06:47,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:47" (1/1) ... [2021-05-02 18:06:47,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:47" (1/1) ... [2021-05-02 18:06:47,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:47" (1/1) ... [2021-05-02 18:06:47,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 18:06:47,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 18:06:47,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 18:06:47,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 18:06:47,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 18:06:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 18:06:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 18:06:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 18:06:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 18:06:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 18:06:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 18:06:47,481 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 18:06:47,481 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-02 18:06:47,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 06:06:47 BoogieIcfgContainer [2021-05-02 18:06:47,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 18:06:47,482 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-02 18:06:47,482 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-02 18:06:47,483 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-02 18:06:47,485 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 06:06:47" (1/1) ... [2021-05-02 18:06:47,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 06:06:47 BasicIcfg [2021-05-02 18:06:47,499 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-02 18:06:47,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 18:06:47,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 18:06:47,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 18:06:47,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 06:06:46" (1/4) ... [2021-05-02 18:06:47,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7999a0e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 06:06:47, skipping insertion in model container [2021-05-02 18:06:47,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 06:06:47" (2/4) ... [2021-05-02 18:06:47,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7999a0e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 06:06:47, skipping insertion in model container [2021-05-02 18:06:47,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 06:06:47" (3/4) ... [2021-05-02 18:06:47,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7999a0e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 06:06:47, skipping insertion in model container [2021-05-02 18:06:47,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 02.05 06:06:47" (4/4) ... [2021-05-02 18:06:47,504 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.cJordan [2021-05-02 18:06:47,507 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-02 18:06:47,510 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-05-02 18:06:47,522 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-05-02 18:06:47,534 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 18:06:47,534 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-02 18:06:47,534 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-02 18:06:47,535 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 18:06:47,535 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 18:06:47,535 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 18:06:47,535 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 18:06:47,535 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 18:06:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 18:06:47,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 18:06:47,549 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:47,550 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:47,550 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2053356655, now seen corresponding path program 1 times [2021-05-02 18:06:47,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:47,560 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950112762] [2021-05-02 18:06:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:47,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:47,763 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:47,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950112762] [2021-05-02 18:06:47,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950112762] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:47,764 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:47,765 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 18:06:47,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139966746] [2021-05-02 18:06:47,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 18:06:47,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:47,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 18:06:47,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 18:06:47,780 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 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 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:47,991 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-05-02 18:06:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 18:06:47,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-02 18:06:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:47,997 INFO L225 Difference]: With dead ends: 84 [2021-05-02 18:06:47,997 INFO L226 Difference]: Without dead ends: 76 [2021-05-02 18:06:47,998 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 106.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 18:06:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-02 18:06:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2021-05-02 18:06:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-05-02 18:06:48,019 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2021-05-02 18:06:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:48,019 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-05-02 18:06:48,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-05-02 18:06:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 18:06:48,019 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:48,020 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:48,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 18:06:48,020 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:48,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:48,020 INFO L82 PathProgramCache]: Analyzing trace with hash 770454336, now seen corresponding path program 1 times [2021-05-02 18:06:48,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:48,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651790622] [2021-05-02 18:06:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:48,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:48,148 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:48,148 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651790622] [2021-05-02 18:06:48,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651790622] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:48,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:48,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 18:06:48,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516372168] [2021-05-02 18:06:48,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 18:06:48,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 18:06:48,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 18:06:48,150 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:48,355 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2021-05-02 18:06:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 18:06:48,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2021-05-02 18:06:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:48,357 INFO L225 Difference]: With dead ends: 75 [2021-05-02 18:06:48,357 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 18:06:48,357 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 165.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 18:06:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 18:06:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2021-05-02 18:06:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-05-02 18:06:48,361 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 14 [2021-05-02 18:06:48,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:48,362 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-05-02 18:06:48,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-05-02 18:06:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 18:06:48,362 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:48,362 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:48,362 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 18:06:48,362 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:48,363 INFO L82 PathProgramCache]: Analyzing trace with hash 770485154, now seen corresponding path program 1 times [2021-05-02 18:06:48,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:48,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522780736] [2021-05-02 18:06:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:48,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:48,478 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:48,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522780736] [2021-05-02 18:06:48,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522780736] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:48,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:48,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 18:06:48,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564354369] [2021-05-02 18:06:48,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 18:06:48,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:48,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 18:06:48,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 18:06:48,479 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:48,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:48,799 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-05-02 18:06:48,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 18:06:48,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 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 14 [2021-05-02 18:06:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:48,807 INFO L225 Difference]: With dead ends: 97 [2021-05-02 18:06:48,807 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 18:06:48,809 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 178.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 18:06:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 18:06:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2021-05-02 18:06:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-05-02 18:06:48,827 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2021-05-02 18:06:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:48,827 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-05-02 18:06:48,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-05-02 18:06:48,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 18:06:48,828 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:48,828 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:48,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 18:06:48,828 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:48,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1884762791, now seen corresponding path program 1 times [2021-05-02 18:06:48,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:48,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760651824] [2021-05-02 18:06:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:48,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:48,925 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:48,925 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760651824] [2021-05-02 18:06:48,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760651824] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:48,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:48,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 18:06:48,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387322673] [2021-05-02 18:06:48,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 18:06:48,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:48,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 18:06:48,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 18:06:48,927 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:49,117 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-05-02 18:06:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 18:06:49,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 18:06:49,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:49,119 INFO L225 Difference]: With dead ends: 94 [2021-05-02 18:06:49,119 INFO L226 Difference]: Without dead ends: 94 [2021-05-02 18:06:49,119 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 98.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 18:06:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-05-02 18:06:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2021-05-02 18:06:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-05-02 18:06:49,122 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2021-05-02 18:06:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:49,122 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-05-02 18:06:49,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-05-02 18:06:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 18:06:49,123 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:49,123 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:49,123 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 18:06:49,123 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1672280616, now seen corresponding path program 1 times [2021-05-02 18:06:49,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:49,124 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661477776] [2021-05-02 18:06:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:49,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:49,174 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:49,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661477776] [2021-05-02 18:06:49,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661477776] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:49,175 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:49,175 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 18:06:49,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302084097] [2021-05-02 18:06:49,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 18:06:49,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:49,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 18:06:49,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 18:06:49,176 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:49,319 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2021-05-02 18:06:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 18:06:49,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-02 18:06:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:49,325 INFO L225 Difference]: With dead ends: 71 [2021-05-02 18:06:49,326 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 18:06:49,326 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 91.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 18:06:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 18:06:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2021-05-02 18:06:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-05-02 18:06:49,328 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2021-05-02 18:06:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:49,329 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-05-02 18:06:49,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-05-02 18:06:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 18:06:49,329 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:49,329 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:49,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 18:06:49,329 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1701896842, now seen corresponding path program 1 times [2021-05-02 18:06:49,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:49,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935778690] [2021-05-02 18:06:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:49,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:49,410 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:49,410 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935778690] [2021-05-02 18:06:49,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935778690] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:49,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:49,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 18:06:49,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031039010] [2021-05-02 18:06:49,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 18:06:49,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:49,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 18:06:49,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 18:06:49,412 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:49,616 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2021-05-02 18:06:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 18:06:49,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-02 18:06:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:49,617 INFO L225 Difference]: With dead ends: 89 [2021-05-02 18:06:49,618 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 18:06:49,618 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 133.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-02 18:06:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 18:06:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2021-05-02 18:06:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-05-02 18:06:49,620 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2021-05-02 18:06:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:49,620 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-05-02 18:06:49,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-05-02 18:06:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 18:06:49,621 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:49,621 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:49,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 18:06:49,621 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:49,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:49,621 INFO L82 PathProgramCache]: Analyzing trace with hash 301092767, now seen corresponding path program 1 times [2021-05-02 18:06:49,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:49,622 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563449975] [2021-05-02 18:06:49,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:49,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:49,680 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:49,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563449975] [2021-05-02 18:06:49,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563449975] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:49,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:49,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 18:06:49,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232035348] [2021-05-02 18:06:49,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 18:06:49,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:49,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 18:06:49,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 18:06:49,681 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:49,899 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2021-05-02 18:06:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 18:06:49,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 18:06:49,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:49,900 INFO L225 Difference]: With dead ends: 77 [2021-05-02 18:06:49,900 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 18:06:49,900 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 151.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 18:06:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 18:06:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2021-05-02 18:06:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-05-02 18:06:49,902 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2021-05-02 18:06:49,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:49,902 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-05-02 18:06:49,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-05-02 18:06:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 18:06:49,903 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:49,903 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:49,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 18:06:49,903 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1219195777, now seen corresponding path program 1 times [2021-05-02 18:06:49,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:49,904 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380940719] [2021-05-02 18:06:49,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:49,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:49,942 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:49,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380940719] [2021-05-02 18:06:49,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380940719] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:49,942 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:49,942 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 18:06:49,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373988280] [2021-05-02 18:06:49,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 18:06:49,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:49,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 18:06:49,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 18:06:49,943 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:50,043 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2021-05-02 18:06:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 18:06:50,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 18:06:50,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:50,044 INFO L225 Difference]: With dead ends: 85 [2021-05-02 18:06:50,044 INFO L226 Difference]: Without dead ends: 85 [2021-05-02 18:06:50,045 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 18:06:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-02 18:06:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-05-02 18:06:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-05-02 18:06:50,047 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2021-05-02 18:06:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:50,047 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-05-02 18:06:50,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-05-02 18:06:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 18:06:50,047 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:50,047 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:50,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 18:06:50,047 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:50,048 INFO L82 PathProgramCache]: Analyzing trace with hash 743942414, now seen corresponding path program 1 times [2021-05-02 18:06:50,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:50,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865752750] [2021-05-02 18:06:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:50,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:50,091 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:50,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865752750] [2021-05-02 18:06:50,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865752750] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:50,091 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:50,091 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 18:06:50,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602898070] [2021-05-02 18:06:50,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 18:06:50,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:50,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 18:06:50,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 18:06:50,092 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:50,263 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2021-05-02 18:06:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 18:06:50,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 18:06:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:50,264 INFO L225 Difference]: With dead ends: 59 [2021-05-02 18:06:50,264 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 18:06:50,265 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 113.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-02 18:06:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 18:06:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2021-05-02 18:06:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-05-02 18:06:50,268 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2021-05-02 18:06:50,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:50,269 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-05-02 18:06:50,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-05-02 18:06:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 18:06:50,271 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:50,271 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:50,271 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 18:06:50,271 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:50,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:50,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1587379587, now seen corresponding path program 1 times [2021-05-02 18:06:50,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:50,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592972682] [2021-05-02 18:06:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:50,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:50,332 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:50,332 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592972682] [2021-05-02 18:06:50,332 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592972682] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:50,332 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:50,332 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 18:06:50,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914314397] [2021-05-02 18:06:50,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 18:06:50,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:50,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 18:06:50,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 18:06:50,335 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:50,428 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2021-05-02 18:06:50,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 18:06:50,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-02 18:06:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:50,430 INFO L225 Difference]: With dead ends: 59 [2021-05-02 18:06:50,430 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 18:06:50,430 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-02 18:06:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 18:06:50,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2021-05-02 18:06:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-05-02 18:06:50,432 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2021-05-02 18:06:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:50,432 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-05-02 18:06:50,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-05-02 18:06:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 18:06:50,433 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:50,433 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:50,433 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 18:06:50,433 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:50,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1964128178, now seen corresponding path program 1 times [2021-05-02 18:06:50,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:50,434 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7731813] [2021-05-02 18:06:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:50,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:50,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-02 18:06:50,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:50,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7731813] [2021-05-02 18:06:50,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7731813] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:50,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:50,482 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 18:06:50,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779595385] [2021-05-02 18:06:50,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 18:06:50,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:50,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 18:06:50,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 18:06:50,483 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:50,639 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2021-05-02 18:06:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 18:06:50,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-02 18:06:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:50,644 INFO L225 Difference]: With dead ends: 67 [2021-05-02 18:06:50,644 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 18:06:50,644 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 18:06:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 18:06:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2021-05-02 18:06:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-05-02 18:06:50,646 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2021-05-02 18:06:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:50,646 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-05-02 18:06:50,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-05-02 18:06:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 18:06:50,647 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:50,647 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:50,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 18:06:50,647 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:50,647 INFO L82 PathProgramCache]: Analyzing trace with hash 758432615, now seen corresponding path program 1 times [2021-05-02 18:06:50,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:50,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315506237] [2021-05-02 18:06:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:50,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:50,694 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:50,694 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315506237] [2021-05-02 18:06:50,694 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315506237] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:50,694 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:50,694 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 18:06:50,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120034549] [2021-05-02 18:06:50,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 18:06:50,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:50,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 18:06:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 18:06:50,695 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:50,863 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2021-05-02 18:06:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 18:06:50,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-02 18:06:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:50,864 INFO L225 Difference]: With dead ends: 72 [2021-05-02 18:06:50,864 INFO L226 Difference]: Without dead ends: 72 [2021-05-02 18:06:50,864 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-02 18:06:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-02 18:06:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2021-05-02 18:06:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-05-02 18:06:50,866 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2021-05-02 18:06:50,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:50,866 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-05-02 18:06:50,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-05-02 18:06:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 18:06:50,867 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:50,867 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:50,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 18:06:50,867 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:50,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2036575830, now seen corresponding path program 1 times [2021-05-02 18:06:50,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:50,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232351340] [2021-05-02 18:06:50,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:50,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:50,925 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:50,925 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232351340] [2021-05-02 18:06:50,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232351340] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:50,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:50,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 18:06:50,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358258829] [2021-05-02 18:06:50,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 18:06:50,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:50,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 18:06:50,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 18:06:50,926 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:51,180 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-05-02 18:06:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 18:06:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-02 18:06:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:51,181 INFO L225 Difference]: With dead ends: 60 [2021-05-02 18:06:51,181 INFO L226 Difference]: Without dead ends: 60 [2021-05-02 18:06:51,181 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 182.1ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-02 18:06:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-02 18:06:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2021-05-02 18:06:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-05-02 18:06:51,183 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2021-05-02 18:06:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:51,183 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-05-02 18:06:51,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-05-02 18:06:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 18:06:51,183 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:51,183 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 18:06:51,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 18:06:51,184 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:51,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:51,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1290657461, now seen corresponding path program 1 times [2021-05-02 18:06:51,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:51,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595723919] [2021-05-02 18:06:51,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:51,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:51,234 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:51,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595723919] [2021-05-02 18:06:51,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595723919] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:51,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:51,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 18:06:51,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785400432] [2021-05-02 18:06:51,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 18:06:51,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:51,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 18:06:51,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 18:06:51,235 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:51,478 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2021-05-02 18:06:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 18:06:51,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 18:06:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:51,479 INFO L225 Difference]: With dead ends: 85 [2021-05-02 18:06:51,479 INFO L226 Difference]: Without dead ends: 85 [2021-05-02 18:06:51,479 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 104.1ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-05-02 18:06:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-02 18:06:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2021-05-02 18:06:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-02 18:06:51,481 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2021-05-02 18:06:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:51,481 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-02 18:06:51,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-02 18:06:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 18:06:51,482 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:51,482 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] [2021-05-02 18:06:51,482 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 18:06:51,482 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:51,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:51,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1355674374, now seen corresponding path program 1 times [2021-05-02 18:06:51,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:51,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618781170] [2021-05-02 18:06:51,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:51,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:51,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:51,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618781170] [2021-05-02 18:06:51,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618781170] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:51,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:51,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 18:06:51,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346248204] [2021-05-02 18:06:51,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 18:06:51,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:51,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 18:06:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 18:06:51,538 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:51,784 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2021-05-02 18:06:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 18:06:51,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 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 24 [2021-05-02 18:06:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:51,785 INFO L225 Difference]: With dead ends: 58 [2021-05-02 18:06:51,785 INFO L226 Difference]: Without dead ends: 58 [2021-05-02 18:06:51,785 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 174.2ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-02 18:06:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-02 18:06:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2021-05-02 18:06:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-05-02 18:06:51,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2021-05-02 18:06:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:51,788 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-05-02 18:06:51,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-05-02 18:06:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-02 18:06:51,788 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 18:06:51,788 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] [2021-05-02 18:06:51,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 18:06:51,789 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 18:06:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 18:06:51,789 INFO L82 PathProgramCache]: Analyzing trace with hash 923768623, now seen corresponding path program 1 times [2021-05-02 18:06:51,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 18:06:51,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159770286] [2021-05-02 18:06:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 18:06:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:51,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 18:06:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 18:06:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 18:06:51,848 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 18:06:51,848 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159770286] [2021-05-02 18:06:51,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159770286] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 18:06:51,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 18:06:51,848 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 18:06:51,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182881456] [2021-05-02 18:06:51,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 18:06:51,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 18:06:51,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 18:06:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 18:06:51,849 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 18:06:52,221 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2021-05-02 18:06:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 18:06:52,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 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 25 [2021-05-02 18:06:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 18:06:52,222 INFO L225 Difference]: With dead ends: 123 [2021-05-02 18:06:52,222 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 18:06:52,222 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 160.1ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-05-02 18:06:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 18:06:52,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 18:06:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 18:06:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 18:06:52,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-05-02 18:06:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 18:06:52,223 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 18:06:52,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 18:06:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 18:06:52,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 18:06:52,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 18:06:52,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 06:06:52 BasicIcfg [2021-05-02 18:06:52,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 18:06:52,229 INFO L168 Benchmark]: Toolchain (without parser) took 5454.40 ms. Allocated memory was 208.7 MB in the beginning and 300.9 MB in the end (delta: 92.3 MB). Free memory was 173.8 MB in the beginning and 274.9 MB in the end (delta: -101.1 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 18:06:52,229 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 208.7 MB. Free memory is still 190.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 18:06:52,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.14 ms. Allocated memory is still 208.7 MB. Free memory was 173.6 MB in the beginning and 188.8 MB in the end (delta: -15.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-02 18:06:52,231 INFO L168 Benchmark]: Boogie Preprocessor took 38.67 ms. Allocated memory is still 208.7 MB. Free memory was 188.8 MB in the beginning and 186.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 18:06:52,231 INFO L168 Benchmark]: RCFGBuilder took 411.58 ms. Allocated memory is still 208.7 MB. Free memory was 186.8 MB in the beginning and 163.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-05-02 18:06:52,232 INFO L168 Benchmark]: IcfgTransformer took 16.25 ms. Allocated memory is still 208.7 MB. Free memory was 163.3 MB in the beginning and 161.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 18:06:52,232 INFO L168 Benchmark]: TraceAbstraction took 4727.54 ms. Allocated memory was 208.7 MB in the beginning and 300.9 MB in the end (delta: 92.3 MB). Free memory was 161.2 MB in the beginning and 274.9 MB in the end (delta: -113.8 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 18:06:52,239 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.09 ms. Allocated memory is still 208.7 MB. Free memory is still 190.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 251.14 ms. Allocated memory is still 208.7 MB. Free memory was 173.6 MB in the beginning and 188.8 MB in the end (delta: -15.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.67 ms. Allocated memory is still 208.7 MB. Free memory was 188.8 MB in the beginning and 186.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 411.58 ms. Allocated memory is still 208.7 MB. Free memory was 186.8 MB in the beginning and 163.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * IcfgTransformer took 16.25 ms. Allocated memory is still 208.7 MB. Free memory was 163.3 MB in the beginning and 161.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4727.54 ms. Allocated memory was 208.7 MB in the beginning and 300.9 MB in the end (delta: 92.3 MB). Free memory was 161.2 MB in the beginning and 274.9 MB in the end (delta: -113.8 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 153]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 165]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 229]: 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: 193]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 217]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 205]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 141]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 59]: 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 3 procedures, 65 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4690.8ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 14.2ms, AutomataDifference: 3356.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 931 SDtfs, 1965 SDslu, 201 SDs, 0 SdLazy, 1664 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1399.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1930.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 59.2ms AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 19.6ms SsaConstructionTime, 120.1ms SatisfiabilityAnalysisTime, 981.7ms InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...