/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-04 19:22:06,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-04 19:22:06,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-04 19:22:06,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-04 19:22:06,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-04 19:22:06,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-04 19:22:06,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-04 19:22:06,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-04 19:22:06,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-04 19:22:06,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-04 19:22:06,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-04 19:22:06,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-04 19:22:06,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-04 19:22:06,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-04 19:22:06,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-04 19:22:06,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-04 19:22:06,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-04 19:22:06,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-04 19:22:06,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-04 19:22:06,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-04 19:22:07,000 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-04 19:22:07,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-04 19:22:07,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-04 19:22:07,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-04 19:22:07,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-04 19:22:07,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-04 19:22:07,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-04 19:22:07,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-04 19:22:07,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-04 19:22:07,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-04 19:22:07,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-04 19:22:07,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-04 19:22:07,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-04 19:22:07,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-04 19:22:07,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-04 19:22:07,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-04 19:22:07,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-04 19:22:07,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-04 19:22:07,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-04 19:22:07,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-04 19:22:07,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-04 19:22:07,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-04 19:22:07,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-04 19:22:07,043 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-04 19:22:07,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-04 19:22:07,044 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-04 19:22:07,044 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-04 19:22:07,044 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-04 19:22:07,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-04 19:22:07,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-04 19:22:07,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-04 19:22:07,045 INFO L138 SettingsManager]: * Use SBE=true [2022-04-04 19:22:07,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-04 19:22:07,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-04 19:22:07,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-04 19:22:07,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-04 19:22:07,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-04 19:22:07,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-04 19:22:07,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-04 19:22:07,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-04 19:22:07,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-04 19:22:07,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-04 19:22:07,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-04 19:22:07,048 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-04 19:22:07,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-04 19:22:07,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-04 19:22:07,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-04 19:22:07,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-04 19:22:07,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-04 19:22:07,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-04 19:22:07,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-04 19:22:07,232 INFO L275 PluginConnector]: CDTParser initialized [2022-04-04 19:22:07,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-04-04 19:22:07,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abae8d95/e7bb3320ad994086ac67e53a89a16d10/FLAG917f17453 [2022-04-04 19:22:07,680 INFO L306 CDTParser]: Found 1 translation units. [2022-04-04 19:22:07,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-04-04 19:22:07,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abae8d95/e7bb3320ad994086ac67e53a89a16d10/FLAG917f17453 [2022-04-04 19:22:07,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abae8d95/e7bb3320ad994086ac67e53a89a16d10 [2022-04-04 19:22:07,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-04 19:22:07,695 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-04 19:22:07,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-04 19:22:07,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-04 19:22:07,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-04 19:22:07,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 07:22:07" (1/1) ... [2022-04-04 19:22:07,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef92a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07, skipping insertion in model container [2022-04-04 19:22:07,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.04 07:22:07" (1/1) ... [2022-04-04 19:22:07,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-04 19:22:07,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-04 19:22:07,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-04-04 19:22:07,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-04-04 19:22:07,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-04-04 19:22:07,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-04-04 19:22:07,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-04-04 19:22:07,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-04-04 19:22:07,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-04-04 19:22:07,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-04-04 19:22:07,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-04-04 19:22:07,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-04-04 19:22:07,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-04-04 19:22:07,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-04-04 19:22:07,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-04-04 19:22:07,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-04-04 19:22:07,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-04-04 19:22:07,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-04-04 19:22:07,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-04-04 19:22:07,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-04 19:22:07,899 INFO L203 MainTranslator]: Completed pre-run [2022-04-04 19:22:07,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-04-04 19:22:07,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-04-04 19:22:07,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-04-04 19:22:07,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-04-04 19:22:07,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-04-04 19:22:07,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-04-04 19:22:07,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-04-04 19:22:07,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-04-04 19:22:07,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-04-04 19:22:07,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-04-04 19:22:07,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-04-04 19:22:07,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-04-04 19:22:07,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-04-04 19:22:07,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-04-04 19:22:07,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-04-04 19:22:07,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-04-04 19:22:07,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-04-04 19:22:07,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-04 19:22:07,942 INFO L208 MainTranslator]: Completed translation [2022-04-04 19:22:07,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07 WrapperNode [2022-04-04 19:22:07,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-04 19:22:07,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-04 19:22:07,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-04 19:22:07,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-04 19:22:07,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07" (1/1) ... [2022-04-04 19:22:07,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07" (1/1) ... [2022-04-04 19:22:07,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07" (1/1) ... [2022-04-04 19:22:07,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07" (1/1) ... [2022-04-04 19:22:07,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07" (1/1) ... [2022-04-04 19:22:07,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07" (1/1) ... [2022-04-04 19:22:07,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07" (1/1) ... [2022-04-04 19:22:07,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-04 19:22:07,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-04 19:22:07,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-04 19:22:07,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-04 19:22:07,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07" (1/1) ... [2022-04-04 19:22:07,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-04 19:22:07,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 19:22:08,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-04 19:22:08,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-04 19:22:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-04 19:22:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-04 19:22:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-04 19:22:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-04 19:22:08,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-04 19:22:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-04 19:22:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-04 19:22:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-04 19:22:08,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-04 19:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-04 19:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-04 19:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-04 19:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-04 19:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-04 19:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-04 19:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-04 19:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-04 19:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-04 19:22:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-04 19:22:08,104 INFO L234 CfgBuilder]: Building ICFG [2022-04-04 19:22:08,105 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-04 19:22:08,306 INFO L275 CfgBuilder]: Performing block encoding [2022-04-04 19:22:08,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-04 19:22:08,311 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-04 19:22:08,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 07:22:08 BoogieIcfgContainer [2022-04-04 19:22:08,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-04 19:22:08,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-04 19:22:08,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-04 19:22:08,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-04 19:22:08,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.04 07:22:07" (1/3) ... [2022-04-04 19:22:08,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f973bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 07:22:08, skipping insertion in model container [2022-04-04 19:22:08,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.04 07:22:07" (2/3) ... [2022-04-04 19:22:08,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f973bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.04 07:22:08, skipping insertion in model container [2022-04-04 19:22:08,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.04 07:22:08" (3/3) ... [2022-04-04 19:22:08,326 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2022-04-04 19:22:08,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-04 19:22:08,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-04-04 19:22:08,357 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-04 19:22:08,361 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-04 19:22:08,362 INFO L341 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-04-04 19:22:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-04 19:22:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-04 19:22:08,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:08,378 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:08,379 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:08,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash -388107236, now seen corresponding path program 1 times [2022-04-04 19:22:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:08,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149655579] [2022-04-04 19:22:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:08,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:08,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149655579] [2022-04-04 19:22:08,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149655579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:08,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:08,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-04 19:22:08,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705460837] [2022-04-04 19:22:08,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:08,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-04 19:22:08,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-04 19:22:08,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-04 19:22:08,594 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 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 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:08,812 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-04-04 19:22:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-04 19:22:08,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 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 12 [2022-04-04 19:22:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:08,825 INFO L225 Difference]: With dead ends: 87 [2022-04-04 19:22:08,825 INFO L226 Difference]: Without dead ends: 69 [2022-04-04 19:22:08,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:08,833 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 126 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:08,834 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 89 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-04 19:22:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-04 19:22:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-04 19:22:08,861 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2022-04-04 19:22:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:08,862 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-04 19:22:08,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-04 19:22:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-04 19:22:08,863 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:08,863 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:08,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-04 19:22:08,863 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash -384872930, now seen corresponding path program 1 times [2022-04-04 19:22:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:08,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33979145] [2022-04-04 19:22:08,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:08,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:08,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33979145] [2022-04-04 19:22:08,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33979145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:08,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:08,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-04 19:22:08,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387632479] [2022-04-04 19:22:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:08,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-04 19:22:08,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:08,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-04 19:22:08,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-04 19:22:08,930 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:09,099 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-04 19:22:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-04 19:22:09,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 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 12 [2022-04-04 19:22:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:09,101 INFO L225 Difference]: With dead ends: 111 [2022-04-04 19:22:09,101 INFO L226 Difference]: Without dead ends: 109 [2022-04-04 19:22:09,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-04 19:22:09,103 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 70 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:09,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 218 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-04 19:22:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 67. [2022-04-04 19:22:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-04 19:22:09,111 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2022-04-04 19:22:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:09,111 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-04 19:22:09,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-04 19:22:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-04 19:22:09,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:09,112 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:09,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-04 19:22:09,112 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash 853580642, now seen corresponding path program 1 times [2022-04-04 19:22:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:09,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321035166] [2022-04-04 19:22:09,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:09,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:09,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:09,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321035166] [2022-04-04 19:22:09,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321035166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:09,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:09,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-04 19:22:09,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975288541] [2022-04-04 19:22:09,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:09,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-04 19:22:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:09,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-04 19:22:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-04 19:22:09,187 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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) [2022-04-04 19:22:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:09,324 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-04 19:22:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-04 19:22:09,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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 [2022-04-04 19:22:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:09,328 INFO L225 Difference]: With dead ends: 73 [2022-04-04 19:22:09,330 INFO L226 Difference]: Without dead ends: 71 [2022-04-04 19:22:09,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:09,332 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:09,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 128 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-04 19:22:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-04-04 19:22:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-04-04 19:22:09,349 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2022-04-04 19:22:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:09,349 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-04-04 19:22:09,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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) [2022-04-04 19:22:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-04-04 19:22:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-04 19:22:09,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:09,350 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:09,350 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-04 19:22:09,350 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:09,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:09,351 INFO L85 PathProgramCache]: Analyzing trace with hash -47660122, now seen corresponding path program 1 times [2022-04-04 19:22:09,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:09,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501438428] [2022-04-04 19:22:09,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:09,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:09,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:09,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:09,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501438428] [2022-04-04 19:22:09,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501438428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:09,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:09,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-04 19:22:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713516573] [2022-04-04 19:22:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:09,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-04 19:22:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:09,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-04 19:22:09,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-04 19:22:09,443 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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) [2022-04-04 19:22:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:09,574 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-04 19:22:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-04 19:22:09,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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 [2022-04-04 19:22:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:09,576 INFO L225 Difference]: With dead ends: 71 [2022-04-04 19:22:09,577 INFO L226 Difference]: Without dead ends: 69 [2022-04-04 19:22:09,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-04 19:22:09,583 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:09,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 126 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-04 19:22:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-04 19:22:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-04 19:22:09,597 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2022-04-04 19:22:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:09,597 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-04 19:22:09,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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) [2022-04-04 19:22:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-04 19:22:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-04 19:22:09,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:09,598 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:09,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-04 19:22:09,598 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:09,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1816251534, now seen corresponding path program 1 times [2022-04-04 19:22:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:09,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563203777] [2022-04-04 19:22:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:09,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563203777] [2022-04-04 19:22:09,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563203777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:09,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:09,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-04 19:22:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816117803] [2022-04-04 19:22:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:09,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-04 19:22:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:09,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-04 19:22:09,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-04 19:22:09,667 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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) [2022-04-04 19:22:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:09,761 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-04 19:22:09,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-04 19:22:09,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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 [2022-04-04 19:22:09,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:09,762 INFO L225 Difference]: With dead ends: 69 [2022-04-04 19:22:09,762 INFO L226 Difference]: Without dead ends: 67 [2022-04-04 19:22:09,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-04 19:22:09,763 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:09,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 120 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-04 19:22:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-04 19:22:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-04 19:22:09,769 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2022-04-04 19:22:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:09,770 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-04 19:22:09,770 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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) [2022-04-04 19:22:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-04 19:22:09,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-04 19:22:09,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:09,770 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:09,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-04 19:22:09,771 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:09,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:09,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1477460696, now seen corresponding path program 1 times [2022-04-04 19:22:09,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:09,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250632741] [2022-04-04 19:22:09,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:09,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:09,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:09,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:09,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250632741] [2022-04-04 19:22:09,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250632741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:09,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:09,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-04 19:22:09,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799536236] [2022-04-04 19:22:09,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:09,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-04 19:22:09,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:09,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-04 19:22:09,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-04 19:22:09,834 INFO L87 Difference]: Start difference. First operand 66 states and 70 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) [2022-04-04 19:22:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:09,901 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-04 19:22:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-04 19:22:09,901 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 [2022-04-04 19:22:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:09,902 INFO L225 Difference]: With dead ends: 67 [2022-04-04 19:22:09,902 INFO L226 Difference]: Without dead ends: 63 [2022-04-04 19:22:09,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:09,905 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:09,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 137 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-04 19:22:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-04 19:22:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-04 19:22:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-04 19:22:09,918 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 16 [2022-04-04 19:22:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:09,918 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-04 19:22:09,918 INFO L479 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) [2022-04-04 19:22:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-04 19:22:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-04 19:22:09,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:09,921 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:09,921 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-04 19:22:09,921 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:09,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash 469655877, now seen corresponding path program 1 times [2022-04-04 19:22:09,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:09,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909473123] [2022-04-04 19:22:09,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:09,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:09,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909473123] [2022-04-04 19:22:09,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909473123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:09,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:09,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-04 19:22:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077381934] [2022-04-04 19:22:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:09,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-04 19:22:09,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:09,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-04 19:22:09,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-04 19:22:09,997 INFO L87 Difference]: Start difference. First operand 62 states and 66 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) [2022-04-04 19:22:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:10,124 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-04-04 19:22:10,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-04 19:22:10,124 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 [2022-04-04 19:22:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:10,125 INFO L225 Difference]: With dead ends: 104 [2022-04-04 19:22:10,125 INFO L226 Difference]: Without dead ends: 102 [2022-04-04 19:22:10,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-04 19:22:10,125 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 96 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:10,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 157 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-04 19:22:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 60. [2022-04-04 19:22:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-04-04 19:22:10,129 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2022-04-04 19:22:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:10,129 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-04-04 19:22:10,129 INFO L479 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) [2022-04-04 19:22:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-04 19:22:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-04 19:22:10,130 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:10,130 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:10,130 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-04 19:22:10,130 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:10,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash 469225894, now seen corresponding path program 1 times [2022-04-04 19:22:10,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:10,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687832559] [2022-04-04 19:22:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:10,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687832559] [2022-04-04 19:22:10,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687832559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:10,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:10,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-04 19:22:10,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415542203] [2022-04-04 19:22:10,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:10,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-04 19:22:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:10,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-04 19:22:10,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-04 19:22:10,162 INFO L87 Difference]: Start difference. First operand 60 states and 64 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) [2022-04-04 19:22:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:10,225 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-04 19:22:10,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-04 19:22:10,225 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 [2022-04-04 19:22:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:10,225 INFO L225 Difference]: With dead ends: 61 [2022-04-04 19:22:10,225 INFO L226 Difference]: Without dead ends: 57 [2022-04-04 19:22:10,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:10,226 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:10,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-04 19:22:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-04 19:22:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-04 19:22:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3255813953488371) 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) [2022-04-04 19:22:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-04 19:22:10,233 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2022-04-04 19:22:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:10,233 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-04 19:22:10,233 INFO L479 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) [2022-04-04 19:22:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-04 19:22:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-04 19:22:10,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:10,236 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:10,236 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-04 19:22:10,237 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1457581016, now seen corresponding path program 1 times [2022-04-04 19:22:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:10,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565750437] [2022-04-04 19:22:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:10,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:10,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565750437] [2022-04-04 19:22:10,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565750437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:10,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:10,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-04 19:22:10,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149751453] [2022-04-04 19:22:10,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:10,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-04 19:22:10,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:10,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-04 19:22:10,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-04 19:22:10,299 INFO L87 Difference]: Start difference. First operand 56 states and 60 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) [2022-04-04 19:22:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:10,391 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-04 19:22:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-04 19:22:10,392 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 [2022-04-04 19:22:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:10,392 INFO L225 Difference]: With dead ends: 74 [2022-04-04 19:22:10,392 INFO L226 Difference]: Without dead ends: 72 [2022-04-04 19:22:10,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-04 19:22:10,393 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 72 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:10,393 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 116 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-04 19:22:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2022-04-04 19:22:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) 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) [2022-04-04 19:22:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-04 19:22:10,396 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2022-04-04 19:22:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:10,396 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-04 19:22:10,397 INFO L479 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) [2022-04-04 19:22:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-04 19:22:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-04 19:22:10,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:10,397 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:10,397 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-04 19:22:10,397 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:10,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1459120216, now seen corresponding path program 1 times [2022-04-04 19:22:10,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:10,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871970678] [2022-04-04 19:22:10,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:10,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:10,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:10,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871970678] [2022-04-04 19:22:10,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871970678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:10,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:10,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-04 19:22:10,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859687428] [2022-04-04 19:22:10,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:10,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-04 19:22:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:10,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-04 19:22:10,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-04 19:22:10,430 INFO L87 Difference]: Start difference. First operand 54 states and 58 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) [2022-04-04 19:22:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:10,501 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-04 19:22:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-04 19:22:10,509 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 [2022-04-04 19:22:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:10,511 INFO L225 Difference]: With dead ends: 55 [2022-04-04 19:22:10,511 INFO L226 Difference]: Without dead ends: 53 [2022-04-04 19:22:10,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-04 19:22:10,512 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:10,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 90 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-04 19:22:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-04 19:22:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2926829268292683) 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) [2022-04-04 19:22:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-04 19:22:10,515 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2022-04-04 19:22:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:10,516 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-04 19:22:10,516 INFO L479 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) [2022-04-04 19:22:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-04 19:22:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-04 19:22:10,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:10,516 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:10,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-04 19:22:10,517 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1674433506, now seen corresponding path program 1 times [2022-04-04 19:22:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:10,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960761919] [2022-04-04 19:22:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:10,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960761919] [2022-04-04 19:22:10,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960761919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:10,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:10,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-04 19:22:10,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379771649] [2022-04-04 19:22:10,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:10,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-04 19:22:10,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:10,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-04 19:22:10,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:10,608 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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) [2022-04-04 19:22:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:10,757 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-04-04 19:22:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-04 19:22:10,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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 [2022-04-04 19:22:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:10,758 INFO L225 Difference]: With dead ends: 110 [2022-04-04 19:22:10,758 INFO L226 Difference]: Without dead ends: 108 [2022-04-04 19:22:10,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-04 19:22:10,759 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 79 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:10,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 233 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-04 19:22:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 57. [2022-04-04 19:22:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-04-04 19:22:10,763 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2022-04-04 19:22:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:10,763 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-04-04 19:22:10,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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) [2022-04-04 19:22:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-04 19:22:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-04 19:22:10,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:10,764 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:10,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-04 19:22:10,764 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:10,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2058260233, now seen corresponding path program 1 times [2022-04-04 19:22:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:10,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417283296] [2022-04-04 19:22:10,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:10,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:10,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:10,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417283296] [2022-04-04 19:22:10,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417283296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:10,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:10,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-04 19:22:10,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753709985] [2022-04-04 19:22:10,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:10,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-04 19:22:10,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:10,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-04 19:22:10,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-04 19:22:10,823 INFO L87 Difference]: Start difference. First operand 57 states and 62 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) [2022-04-04 19:22:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:10,914 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-04-04 19:22:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-04 19:22:10,914 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 [2022-04-04 19:22:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:10,915 INFO L225 Difference]: With dead ends: 77 [2022-04-04 19:22:10,915 INFO L226 Difference]: Without dead ends: 75 [2022-04-04 19:22:10,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-04 19:22:10,916 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:10,916 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 108 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-04 19:22:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2022-04-04 19:22:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-04-04 19:22:10,919 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 18 [2022-04-04 19:22:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:10,919 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-04-04 19:22:10,919 INFO L479 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) [2022-04-04 19:22:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-04 19:22:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-04 19:22:10,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:10,920 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:10,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-04 19:22:10,920 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2059625653, now seen corresponding path program 1 times [2022-04-04 19:22:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:10,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316437775] [2022-04-04 19:22:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:10,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:10,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:10,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316437775] [2022-04-04 19:22:10,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316437775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:10,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:10,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-04 19:22:10,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157592964] [2022-04-04 19:22:10,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:10,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-04 19:22:10,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:10,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-04 19:22:10,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:10,997 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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) [2022-04-04 19:22:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:11,121 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-04 19:22:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-04 19:22:11,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 [2022-04-04 19:22:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:11,123 INFO L225 Difference]: With dead ends: 92 [2022-04-04 19:22:11,123 INFO L226 Difference]: Without dead ends: 90 [2022-04-04 19:22:11,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-04 19:22:11,124 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 58 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:11,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 167 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-04 19:22:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2022-04-04 19:22:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-04-04 19:22:11,134 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 18 [2022-04-04 19:22:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:11,134 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-04-04 19:22:11,134 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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) [2022-04-04 19:22:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-04 19:22:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-04 19:22:11,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:11,134 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:11,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-04 19:22:11,135 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2011910403, now seen corresponding path program 1 times [2022-04-04 19:22:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:11,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766569961] [2022-04-04 19:22:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:11,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766569961] [2022-04-04 19:22:11,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766569961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:11,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:11,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-04 19:22:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178291145] [2022-04-04 19:22:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:11,197 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-04 19:22:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-04 19:22:11,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:11,198 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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) [2022-04-04 19:22:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:11,302 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-04 19:22:11,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-04 19:22:11,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 [2022-04-04 19:22:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:11,302 INFO L225 Difference]: With dead ends: 76 [2022-04-04 19:22:11,303 INFO L226 Difference]: Without dead ends: 72 [2022-04-04 19:22:11,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-04 19:22:11,303 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:11,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-04 19:22:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-04-04 19:22:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-04 19:22:11,306 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 18 [2022-04-04 19:22:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:11,306 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-04 19:22:11,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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) [2022-04-04 19:22:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-04 19:22:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-04 19:22:11,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:11,307 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:11,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-04 19:22:11,307 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:11,307 INFO L85 PathProgramCache]: Analyzing trace with hash 361585193, now seen corresponding path program 1 times [2022-04-04 19:22:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:11,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708295621] [2022-04-04 19:22:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:11,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708295621] [2022-04-04 19:22:11,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708295621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:11,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:11,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-04 19:22:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519391020] [2022-04-04 19:22:11,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:11,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-04 19:22:11,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:11,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-04 19:22:11,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:11,371 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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) [2022-04-04 19:22:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:11,472 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-04 19:22:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-04 19:22:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 [2022-04-04 19:22:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:11,473 INFO L225 Difference]: With dead ends: 72 [2022-04-04 19:22:11,474 INFO L226 Difference]: Without dead ends: 70 [2022-04-04 19:22:11,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-04 19:22:11,476 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 72 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:11,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 96 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-04 19:22:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-04-04 19:22:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-04 19:22:11,480 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2022-04-04 19:22:11,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:11,481 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-04 19:22:11,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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) [2022-04-04 19:22:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-04 19:22:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-04 19:22:11,482 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:11,482 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:11,482 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-04 19:22:11,482 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash 618445355, now seen corresponding path program 1 times [2022-04-04 19:22:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:11,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898143303] [2022-04-04 19:22:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:11,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:11,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898143303] [2022-04-04 19:22:11,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898143303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:11,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:11,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-04 19:22:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49477610] [2022-04-04 19:22:11,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:11,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-04 19:22:11,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-04 19:22:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:11,541 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:11,674 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-04 19:22:11,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-04 19:22:11,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-04 19:22:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:11,675 INFO L225 Difference]: With dead ends: 91 [2022-04-04 19:22:11,675 INFO L226 Difference]: Without dead ends: 89 [2022-04-04 19:22:11,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-04 19:22:11,675 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 49 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:11,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 199 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:11,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-04 19:22:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-04 19:22:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-04 19:22:11,679 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2022-04-04 19:22:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:11,679 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-04 19:22:11,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-04 19:22:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-04 19:22:11,680 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:11,680 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:11,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-04 19:22:11,680 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:11,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:11,680 INFO L85 PathProgramCache]: Analyzing trace with hash 679767566, now seen corresponding path program 1 times [2022-04-04 19:22:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:11,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378948498] [2022-04-04 19:22:11,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:11,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:11,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378948498] [2022-04-04 19:22:11,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378948498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:11,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:11,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-04 19:22:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881114204] [2022-04-04 19:22:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:11,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-04 19:22:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:11,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-04 19:22:11,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-04 19:22:11,709 INFO L87 Difference]: Start difference. First operand 67 states and 74 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) [2022-04-04 19:22:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:11,761 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-04 19:22:11,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-04 19:22:11,761 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 [2022-04-04 19:22:11,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:11,762 INFO L225 Difference]: With dead ends: 67 [2022-04-04 19:22:11,762 INFO L226 Difference]: Without dead ends: 65 [2022-04-04 19:22:11,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:11,763 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:11,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 74 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-04 19:22:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-04 19:22:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-04 19:22:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-04-04 19:22:11,766 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 20 [2022-04-04 19:22:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:11,766 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-04-04 19:22:11,766 INFO L479 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) [2022-04-04 19:22:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-04 19:22:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-04 19:22:11,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:11,767 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:11,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-04 19:22:11,767 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:11,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:11,767 INFO L85 PathProgramCache]: Analyzing trace with hash -402038812, now seen corresponding path program 1 times [2022-04-04 19:22:11,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:11,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116434995] [2022-04-04 19:22:11,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:11,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:11,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:11,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116434995] [2022-04-04 19:22:11,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116434995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:11,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:11,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-04 19:22:11,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351203411] [2022-04-04 19:22:11,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:11,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-04 19:22:11,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:11,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-04 19:22:11,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-04 19:22:11,803 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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) [2022-04-04 19:22:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:11,856 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-04 19:22:11,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-04 19:22:11,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 [2022-04-04 19:22:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:11,857 INFO L225 Difference]: With dead ends: 65 [2022-04-04 19:22:11,857 INFO L226 Difference]: Without dead ends: 61 [2022-04-04 19:22:11,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:11,858 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:11,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-04 19:22:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-04 19:22:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-04 19:22:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-04 19:22:11,861 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2022-04-04 19:22:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:11,861 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-04 19:22:11,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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) [2022-04-04 19:22:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-04 19:22:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-04 19:22:11,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:11,862 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:11,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-04 19:22:11,862 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash 434938978, now seen corresponding path program 1 times [2022-04-04 19:22:11,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:11,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882717365] [2022-04-04 19:22:11,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:11,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:11,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:11,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882717365] [2022-04-04 19:22:11,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882717365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:11,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:11,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-04 19:22:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856707272] [2022-04-04 19:22:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:11,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-04 19:22:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-04 19:22:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:11,906 INFO L87 Difference]: Start difference. First operand 61 states and 68 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) [2022-04-04 19:22:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:12,014 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-04-04 19:22:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-04 19:22:12,014 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 [2022-04-04 19:22:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:12,015 INFO L225 Difference]: With dead ends: 76 [2022-04-04 19:22:12,015 INFO L226 Difference]: Without dead ends: 74 [2022-04-04 19:22:12,015 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-04 19:22:12,015 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 78 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:12,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 67 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-04 19:22:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-04-04 19:22:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-04-04 19:22:12,019 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 22 [2022-04-04 19:22:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:12,019 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-04-04 19:22:12,019 INFO L479 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) [2022-04-04 19:22:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-04-04 19:22:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-04 19:22:12,019 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:12,019 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:12,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-04 19:22:12,020 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash -178138558, now seen corresponding path program 1 times [2022-04-04 19:22:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:12,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494636129] [2022-04-04 19:22:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:12,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:12,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494636129] [2022-04-04 19:22:12,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494636129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 19:22:12,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593368896] [2022-04-04 19:22:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:12,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 19:22:12,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 19:22:12,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-04 19:22:12,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-04 19:22:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:12,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-04 19:22:12,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 19:22:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:12,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 19:22:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-04 19:22:12,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593368896] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-04 19:22:12,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-04 19:22:12,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-04 19:22:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490562430] [2022-04-04 19:22:12,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-04 19:22:12,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-04 19:22:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-04 19:22:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-04 19:22:12,464 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:12,659 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-04-04 19:22:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-04 19:22:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-04 19:22:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:12,659 INFO L225 Difference]: With dead ends: 102 [2022-04-04 19:22:12,659 INFO L226 Difference]: Without dead ends: 100 [2022-04-04 19:22:12,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-04-04 19:22:12,661 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 335 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:12,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 100 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-04 19:22:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 52. [2022-04-04 19:22:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-04 19:22:12,668 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-04-04 19:22:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:12,668 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-04 19:22:12,668 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-04 19:22:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-04 19:22:12,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:12,669 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:12,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-04 19:22:12,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 19:22:12,880 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:12,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash -93650716, now seen corresponding path program 1 times [2022-04-04 19:22:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:12,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528014520] [2022-04-04 19:22:12,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:12,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:12,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:12,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528014520] [2022-04-04 19:22:12,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528014520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:12,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:12,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-04 19:22:12,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215950976] [2022-04-04 19:22:12,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:12,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-04 19:22:12,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:12,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-04 19:22:12,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:12,927 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:13,033 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-04-04 19:22:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-04 19:22:13,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-04 19:22:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:13,033 INFO L225 Difference]: With dead ends: 64 [2022-04-04 19:22:13,033 INFO L226 Difference]: Without dead ends: 62 [2022-04-04 19:22:13,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-04 19:22:13,034 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 88 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:13,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 52 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-04 19:22:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-04 19:22:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-04-04 19:22:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-04-04 19:22:13,038 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 23 [2022-04-04 19:22:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:13,038 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-04-04 19:22:13,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-04 19:22:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-04 19:22:13,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:13,055 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:13,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-04 19:22:13,055 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash -45935466, now seen corresponding path program 1 times [2022-04-04 19:22:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:13,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412451118] [2022-04-04 19:22:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:13,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412451118] [2022-04-04 19:22:13,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412451118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-04 19:22:13,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-04 19:22:13,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-04 19:22:13,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437694241] [2022-04-04 19:22:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-04 19:22:13,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-04 19:22:13,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:13,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-04 19:22:13,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-04 19:22:13,101 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:13,194 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-04 19:22:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-04 19:22:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-04 19:22:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:13,195 INFO L225 Difference]: With dead ends: 47 [2022-04-04 19:22:13,195 INFO L226 Difference]: Without dead ends: 24 [2022-04-04 19:22:13,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-04 19:22:13,196 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 50 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:13,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 47 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-04 19:22:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-04 19:22:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-04 19:22:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-04 19:22:13,198 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 23 [2022-04-04 19:22:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:13,198 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-04 19:22:13,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-04 19:22:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-04 19:22:13,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-04 19:22:13,199 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:22:13,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-04 19:22:13,199 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-04 19:22:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-04 19:22:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1233573943, now seen corresponding path program 1 times [2022-04-04 19:22:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-04 19:22:13,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780260481] [2022-04-04 19:22:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:13,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-04 19:22:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:13,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-04 19:22:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-04 19:22:13,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780260481] [2022-04-04 19:22:13,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780260481] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-04 19:22:13,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038231434] [2022-04-04 19:22:13,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-04 19:22:13,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-04 19:22:13,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-04 19:22:13,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-04 19:22:13,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-04 19:22:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-04 19:22:13,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-04 19:22:13,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-04 19:22:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-04 19:22:13,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-04 19:22:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-04 19:22:13,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038231434] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-04 19:22:13,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-04 19:22:13,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-04 19:22:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646212091] [2022-04-04 19:22:13,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-04 19:22:13,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-04 19:22:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-04 19:22:13,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-04 19:22:13,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-04 19:22:13,547 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-04 19:22:13,630 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-04-04 19:22:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-04 19:22:13,630 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-04 19:22:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-04 19:22:13,630 INFO L225 Difference]: With dead ends: 35 [2022-04-04 19:22:13,631 INFO L226 Difference]: Without dead ends: 0 [2022-04-04 19:22:13,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-04-04 19:22:13,631 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-04 19:22:13,631 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 57 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-04 19:22:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-04 19:22:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-04 19:22:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-04 19:22:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-04 19:22:13,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-04 19:22:13,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-04 19:22:13,632 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-04 19:22:13,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-04 19:22:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-04 19:22:13,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-04 19:22:13,634 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2022-04-04 19:22:13,634 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2022-04-04 19:22:13,634 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2022-04-04 19:22:13,634 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2022-04-04 19:22:13,634 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2022-04-04 19:22:13,634 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2022-04-04 19:22:13,635 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2022-04-04 19:22:13,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-04 19:22:13,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-04 19:22:13,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-04 19:24:39,678 WARN L232 SmtUtils]: Spent 2.42m on a formula simplification. DAG size of input: 77 DAG size of output: 74 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-04 19:24:48,062 WARN L232 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 86 DAG size of output: 87 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-04 19:24:48,518 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-04 19:24:48,518 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-04 19:24:48,518 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-04 19:24:48,518 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L878 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 15 375) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2022-04-04 19:24:48,519 INFO L882 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 15 375) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 15 375) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2022-04-04 19:24:48,520 INFO L882 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L878 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (let ((.cse2 (<= main_~main__t~0 1))) (let ((.cse0 (let ((.cse4 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse2 .cse4 (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0))) (and .cse4 (not (= main_~__VERIFIER_assert__cond~17 0)))))) (.cse1 (<= 1 main_~main__t~0)) (.cse3 (< main_~main__t~0 main_~main__tagbuf_len~0))) (or (and (<= 1 main_~__VERIFIER_assert__cond~17) .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1) (and .cse2 .cse3 .cse0 .cse1) (and .cse3 (= main_~main__t~0 0))))) [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L878 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2022-04-04 19:24:48,521 INFO L882 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L878 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L878 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse0 (= main_~main__t~0 0))) (let ((.cse1 (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse3 (<= 0 main_~main__t~0))) (or (and .cse2 .cse3 .cse0) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0))))))) (or (and (< main_~main__t~0 main_~main__tagbuf_len~0) .cse0 .cse1) (and (<= 1 main_~__VERIFIER_assert__cond~17) .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))))) [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-04 19:24:48,522 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-04 19:24:48,523 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-04 19:24:48,523 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-04 19:24:48,525 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-04 19:24:48,525 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-04 19:24:48,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.04 07:24:48 BoogieIcfgContainer [2022-04-04 19:24:48,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-04 19:24:48,537 INFO L158 Benchmark]: Toolchain (without parser) took 160841.73ms. Allocated memory was 183.5MB in the beginning and 614.5MB in the end (delta: 431.0MB). Free memory was 135.1MB in the beginning and 340.5MB in the end (delta: -205.4MB). Peak memory consumption was 348.2MB. Max. memory is 8.0GB. [2022-04-04 19:24:48,537 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-04 19:24:48,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.19ms. Allocated memory is still 183.5MB. Free memory was 134.8MB in the beginning and 155.8MB in the end (delta: -21.0MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-04 19:24:48,538 INFO L158 Benchmark]: Boogie Preprocessor took 34.47ms. Allocated memory is still 183.5MB. Free memory was 155.8MB in the beginning and 154.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-04 19:24:48,538 INFO L158 Benchmark]: RCFGBuilder took 333.74ms. Allocated memory is still 183.5MB. Free memory was 154.2MB in the beginning and 139.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-04 19:24:48,538 INFO L158 Benchmark]: TraceAbstraction took 160223.33ms. Allocated memory was 183.5MB in the beginning and 614.5MB in the end (delta: 431.0MB). Free memory was 138.5MB in the beginning and 340.5MB in the end (delta: -202.1MB). Peak memory consumption was 351.6MB. Max. memory is 8.0GB. [2022-04-04 19:24:48,539 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.09ms. Allocated memory is still 183.5MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.19ms. Allocated memory is still 183.5MB. Free memory was 134.8MB in the beginning and 155.8MB in the end (delta: -21.0MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.47ms. Allocated memory is still 183.5MB. Free memory was 155.8MB in the beginning and 154.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 333.74ms. Allocated memory is still 183.5MB. Free memory was 154.2MB in the beginning and 139.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 160223.33ms. Allocated memory was 183.5MB in the beginning and 614.5MB in the end (delta: 431.0MB). Free memory was 138.5MB in the beginning and 340.5MB in the end (delta: -202.1MB). Peak memory consumption was 351.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 83 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 160.2s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 154.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1635 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1635 mSDsluCounter, 2714 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1688 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3171 IncrementalHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 1026 mSDtfsCounter, 3171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 146 SyntacticMatches, 10 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 329 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 212 HoareAnnotationTreeSize, 9 FomulaSimplifications, 222349 FormulaSimplificationTreeSizeReduction, 154.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2542155 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 2171 SizeOfPredicates, 6 NumberOfNonLiveVariables, 305 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 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 17 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && main__t == 0) && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) || ((1 <= __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((1 <= __VERIFIER_assert__cond && ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && 0 < main__tagbuf_len + 1) && !(main__tagbuf_len == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) && 1 <= main__t) || (((main__t <= 1 && main__t < main__tagbuf_len) && ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && 0 < main__tagbuf_len + 1) && !(main__tagbuf_len == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__t)) || (main__t < main__tagbuf_len && main__t == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len <= main__t)) && 1 <= main__t RESULT: Ultimate proved your program to be correct! [2022-04-04 19:24:48,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...