/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 05:18:52,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 05:18:52,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 05:18:52,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 05:18:52,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 05:18:52,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 05:18:52,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 05:18:52,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 05:18:52,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 05:18:52,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 05:18:52,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 05:18:52,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 05:18:52,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 05:18:52,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 05:18:52,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 05:18:52,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 05:18:52,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 05:18:52,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 05:18:52,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 05:18:52,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 05:18:52,764 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 05:18:52,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 05:18:52,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 05:18:52,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 05:18:52,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 05:18:52,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 05:18:52,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 05:18:52,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 05:18:52,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 05:18:52,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 05:18:52,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 05:18:52,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 05:18:52,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 05:18:52,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 05:18:52,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 05:18:52,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 05:18:52,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 05:18:52,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 05:18:52,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 05:18:52,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 05:18:52,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 05:18:52,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 05:18:52,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 05:18:52,801 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 05:18:52,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 05:18:52,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 05:18:52,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 05:18:52,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 05:18:52,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 05:18:52,803 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 05:18:52,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 05:18:52,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 05:18:52,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 05:18:52,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 05:18:52,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 05:18:52,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 05:18:52,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 05:18:52,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 05:18:52,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 05:18:52,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 05:18:52,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 05:18:52,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 05:18:52,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:18:52,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 05:18:52,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 05:18:52,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 05:18:52,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 05:18:52,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 05:18:52,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 05:18:52,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 05:18:52,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 05:18:52,806 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 05:18:52,806 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-05 05:18:52,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 05:18:53,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 05:18:53,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 05:18:53,012 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 05:18:53,012 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 05:18:53,013 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.p+lhb-reducer.c [2022-04-05 05:18:53,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55007c1d9/c3ea22c07caa4e178fcb01a8e96d4ea6/FLAG03b874b20 [2022-04-05 05:18:53,364 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 05:18:53,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-04-05 05:18:53,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55007c1d9/c3ea22c07caa4e178fcb01a8e96d4ea6/FLAG03b874b20 [2022-04-05 05:18:53,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55007c1d9/c3ea22c07caa4e178fcb01a8e96d4ea6 [2022-04-05 05:18:53,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 05:18:53,773 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 05:18:53,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 05:18:53,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 05:18:53,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 05:18:53,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:18:53" (1/1) ... [2022-04-05 05:18:53,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ed02ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:53, skipping insertion in model container [2022-04-05 05:18:53,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:18:53" (1/1) ... [2022-04-05 05:18:53,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 05:18:53,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 05:18:54,003 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.p+lhb-reducer.c[919,932] [2022-04-05 05:18:54,010 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.p+lhb-reducer.c[1134,1147] [2022-04-05 05:18:54,013 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.p+lhb-reducer.c[2208,2221] [2022-04-05 05:18:54,014 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.p+lhb-reducer.c[2423,2436] [2022-04-05 05:18:54,015 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.p+lhb-reducer.c[2918,2931] [2022-04-05 05:18:54,016 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.p+lhb-reducer.c[3133,3146] [2022-04-05 05:18:54,017 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.p+lhb-reducer.c[3435,3448] [2022-04-05 05:18:54,022 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.p+lhb-reducer.c[3653,3666] [2022-04-05 05:18:54,023 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.p+lhb-reducer.c[3929,3942] [2022-04-05 05:18:54,024 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.p+lhb-reducer.c[4147,4160] [2022-04-05 05:18:54,025 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.p+lhb-reducer.c[4717,4730] [2022-04-05 05:18:54,026 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.p+lhb-reducer.c[4935,4948] [2022-04-05 05:18:54,051 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.p+lhb-reducer.c[15828,15841] [2022-04-05 05:18:54,065 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.p+lhb-reducer.c[16046,16059] [2022-04-05 05:18:54,067 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.p+lhb-reducer.c[16441,16454] [2022-04-05 05:18:54,068 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.p+lhb-reducer.c[16659,16672] [2022-04-05 05:18:54,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:18:54,078 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 05:18:54,094 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.p+lhb-reducer.c[919,932] [2022-04-05 05:18:54,094 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.p+lhb-reducer.c[1134,1147] [2022-04-05 05:18:54,096 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.p+lhb-reducer.c[2208,2221] [2022-04-05 05:18:54,097 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.p+lhb-reducer.c[2423,2436] [2022-04-05 05:18:54,098 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.p+lhb-reducer.c[2918,2931] [2022-04-05 05:18:54,098 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.p+lhb-reducer.c[3133,3146] [2022-04-05 05:18:54,099 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.p+lhb-reducer.c[3435,3448] [2022-04-05 05:18:54,100 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.p+lhb-reducer.c[3653,3666] [2022-04-05 05:18:54,100 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.p+lhb-reducer.c[3929,3942] [2022-04-05 05:18:54,101 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.p+lhb-reducer.c[4147,4160] [2022-04-05 05:18:54,102 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.p+lhb-reducer.c[4717,4730] [2022-04-05 05:18:54,103 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.p+lhb-reducer.c[4935,4948] [2022-04-05 05:18:54,126 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.p+lhb-reducer.c[15828,15841] [2022-04-05 05:18:54,127 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.p+lhb-reducer.c[16046,16059] [2022-04-05 05:18:54,128 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.p+lhb-reducer.c[16441,16454] [2022-04-05 05:18:54,129 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.p+lhb-reducer.c[16659,16672] [2022-04-05 05:18:54,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:18:54,139 INFO L208 MainTranslator]: Completed translation [2022-04-05 05:18:54,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:54 WrapperNode [2022-04-05 05:18:54,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 05:18:54,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 05:18:54,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 05:18:54,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 05:18:54,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:54" (1/1) ... [2022-04-05 05:18:54,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:54" (1/1) ... [2022-04-05 05:18:54,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:54" (1/1) ... [2022-04-05 05:18:54,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:54" (1/1) ... [2022-04-05 05:18:54,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:54" (1/1) ... [2022-04-05 05:18:54,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:54" (1/1) ... [2022-04-05 05:18:54,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:54" (1/1) ... [2022-04-05 05:18:54,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 05:18:54,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 05:18:54,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 05:18:54,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 05:18:54,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:54" (1/1) ... [2022-04-05 05:18:54,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:18:54,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:18:54,202 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-05 05:18:54,229 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-05 05:18:54,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 05:18:54,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 05:18:54,242 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 05:18:54,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-05 05:18:54,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 05:18:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 05:18:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 05:18:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 05:18:54,321 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 05:18:54,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 05:18:54,620 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 05:18:54,625 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 05:18:54,625 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-05 05:18:54,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:18:54 BoogieIcfgContainer [2022-04-05 05:18:54,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 05:18:54,627 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 05:18:54,627 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 05:18:54,631 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 05:18:54,633 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:18:54" (1/1) ... [2022-04-05 05:18:54,635 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 05:18:54,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:18:54 BasicIcfg [2022-04-05 05:18:54,663 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 05:18:54,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 05:18:54,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 05:18:54,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 05:18:54,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:18:53" (1/4) ... [2022-04-05 05:18:54,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2cebe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:18:54, skipping insertion in model container [2022-04-05 05:18:54,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:18:54" (2/4) ... [2022-04-05 05:18:54,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2cebe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:18:54, skipping insertion in model container [2022-04-05 05:18:54,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:18:54" (3/4) ... [2022-04-05 05:18:54,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2cebe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:18:54, skipping insertion in model container [2022-04-05 05:18:54,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:18:54" (4/4) ... [2022-04-05 05:18:54,668 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.cqvasr [2022-04-05 05:18:54,671 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 05:18:54,671 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-05 05:18:54,708 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 05:18:54,714 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=FINITE_AUTOMATA, 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-05 05:18:54,714 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-05 05:18:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 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-05 05:18:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 05:18:54,741 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:54,741 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:18:54,743 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:54,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1316985673, now seen corresponding path program 1 times [2022-04-05 05:18:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:54,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681046051] [2022-04-05 05:18:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:54,959 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-05 05:18:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:54,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681046051] [2022-04-05 05:18:54,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681046051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:54,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:54,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:18:54,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368132794] [2022-04-05 05:18:54,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:54,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:18:54,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:18:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:18:54,991 INFO L87 Difference]: Start difference. First operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 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.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 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-05 05:18:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:55,335 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2022-04-05 05:18:55,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:18:55,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 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 11 [2022-04-05 05:18:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:55,344 INFO L225 Difference]: With dead ends: 143 [2022-04-05 05:18:55,344 INFO L226 Difference]: Without dead ends: 123 [2022-04-05 05:18:55,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:18:55,348 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 269 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:55,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 118 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:18:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-05 05:18:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2022-04-05 05:18:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 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-05 05:18:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2022-04-05 05:18:55,375 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2022-04-05 05:18:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:55,375 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2022-04-05 05:18:55,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 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-05 05:18:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-04-05 05:18:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-05 05:18:55,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:55,376 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:18:55,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 05:18:55,376 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2123118550, now seen corresponding path program 1 times [2022-04-05 05:18:55,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:55,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735963970] [2022-04-05 05:18:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:55,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:55,486 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-05 05:18:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:55,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735963970] [2022-04-05 05:18:55,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735963970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:55,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:55,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:18:55,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910205072] [2022-04-05 05:18:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:55,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:18:55,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:55,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:18:55,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:18:55,488 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-05 05:18:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:55,728 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2022-04-05 05:18:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:18:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-05 05:18:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:55,731 INFO L225 Difference]: With dead ends: 121 [2022-04-05 05:18:55,732 INFO L226 Difference]: Without dead ends: 113 [2022-04-05 05:18:55,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-05 05:18:55,733 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 85 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:55,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 248 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:18:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-05 05:18:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-05 05:18:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 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-05 05:18:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-04-05 05:18:55,746 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2022-04-05 05:18:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:55,746 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-04-05 05:18:55,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-05 05:18:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-05 05:18:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-05 05:18:55,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:55,747 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:18:55,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 05:18:55,747 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:55,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash 532189412, now seen corresponding path program 1 times [2022-04-05 05:18:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:55,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803795129] [2022-04-05 05:18:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:55,811 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-05 05:18:55,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:55,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803795129] [2022-04-05 05:18:55,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803795129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:55,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:55,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:18:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642044572] [2022-04-05 05:18:55,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:55,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:18:55,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:18:55,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:18:55,813 INFO L87 Difference]: Start difference. First operand 113 states and 125 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-05 05:18:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:56,009 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-05 05:18:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:18:56,009 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-05 05:18:56,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:56,010 INFO L225 Difference]: With dead ends: 113 [2022-04-05 05:18:56,010 INFO L226 Difference]: Without dead ends: 111 [2022-04-05 05:18:56,010 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-05 05:18:56,011 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 140 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:56,011 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 118 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:18:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-05 05:18:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-05 05:18:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 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-05 05:18:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-04-05 05:18:56,016 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2022-04-05 05:18:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:56,016 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-04-05 05:18:56,016 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-05 05:18:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-05 05:18:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-05 05:18:56,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:56,017 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:18:56,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 05:18:56,017 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash -681995930, now seen corresponding path program 1 times [2022-04-05 05:18:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:56,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136062560] [2022-04-05 05:18:56,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:56,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:56,071 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-05 05:18:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:56,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136062560] [2022-04-05 05:18:56,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136062560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:56,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:56,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:18:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19365036] [2022-04-05 05:18:56,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:56,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:18:56,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:56,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:18:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:18:56,072 INFO L87 Difference]: Start difference. First operand 111 states and 123 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-05 05:18:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:56,206 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-05 05:18:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 05:18:56,206 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-05 05:18:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:56,207 INFO L225 Difference]: With dead ends: 111 [2022-04-05 05:18:56,207 INFO L226 Difference]: Without dead ends: 107 [2022-04-05 05:18:56,207 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-05 05:18:56,208 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:56,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:18:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-05 05:18:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-05 05:18:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 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-05 05:18:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-04-05 05:18:56,220 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2022-04-05 05:18:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:56,221 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-04-05 05:18:56,221 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-05 05:18:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-05 05:18:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 05:18:56,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:56,221 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:18:56,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-05 05:18:56,222 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 333918414, now seen corresponding path program 1 times [2022-04-05 05:18:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:56,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535459801] [2022-04-05 05:18:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:56,266 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-05 05:18:56,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:56,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535459801] [2022-04-05 05:18:56,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535459801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:56,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:56,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:18:56,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027430438] [2022-04-05 05:18:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:56,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:18:56,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:56,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:18:56,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:18:56,267 INFO L87 Difference]: Start difference. First operand 107 states and 119 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-05 05:18:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:56,472 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2022-04-05 05:18:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:18:56,473 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-05 05:18:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:56,474 INFO L225 Difference]: With dead ends: 125 [2022-04-05 05:18:56,474 INFO L226 Difference]: Without dead ends: 123 [2022-04-05 05:18:56,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-05 05:18:56,474 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 157 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:56,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 128 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:18:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-05 05:18:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-04-05 05:18:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 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-05 05:18:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-04-05 05:18:56,479 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2022-04-05 05:18:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:56,479 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-04-05 05:18:56,480 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-05 05:18:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-04-05 05:18:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 05:18:56,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:56,480 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:18:56,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-05 05:18:56,480 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash 333950226, now seen corresponding path program 1 times [2022-04-05 05:18:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:56,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297062730] [2022-04-05 05:18:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:56,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:56,521 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-05 05:18:56,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:56,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297062730] [2022-04-05 05:18:56,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297062730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:56,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:56,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:18:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270316391] [2022-04-05 05:18:56,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:56,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:18:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:56,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:18:56,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:18:56,524 INFO L87 Difference]: Start difference. First operand 105 states and 117 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-05 05:18:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:56,717 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-04-05 05:18:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:18:56,717 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-05 05:18:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:56,718 INFO L225 Difference]: With dead ends: 105 [2022-04-05 05:18:56,718 INFO L226 Difference]: Without dead ends: 103 [2022-04-05 05:18:56,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-05 05:18:56,719 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 130 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:56,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 100 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:18:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-05 05:18:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-05 05:18:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 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-05 05:18:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-05 05:18:56,723 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2022-04-05 05:18:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:56,723 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-05 05:18:56,723 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-05 05:18:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-05 05:18:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-05 05:18:56,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:56,723 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-05 05:18:56,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-05 05:18:56,724 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:56,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1761537745, now seen corresponding path program 1 times [2022-04-05 05:18:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:56,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489650833] [2022-04-05 05:18:56,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:56,806 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-05 05:18:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:56,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489650833] [2022-04-05 05:18:56,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489650833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:56,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:56,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:18:56,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277102528] [2022-04-05 05:18:56,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:56,807 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:18:56,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:56,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:18:56,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:18:56,807 INFO L87 Difference]: Start difference. First operand 103 states and 115 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-05 05:18:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:57,022 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2022-04-05 05:18:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:18:57,023 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-05 05:18:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:57,023 INFO L225 Difference]: With dead ends: 140 [2022-04-05 05:18:57,023 INFO L226 Difference]: Without dead ends: 138 [2022-04-05 05:18:57,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-05 05:18:57,024 INFO L913 BasicCegarLoop]: 111 mSDtfsCounter, 108 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:57,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 226 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:18:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-05 05:18:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2022-04-05 05:18:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.25) internal successors, (120), 105 states have internal predecessors, (120), 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-05 05:18:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-04-05 05:18:57,029 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 18 [2022-04-05 05:18:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:57,029 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-04-05 05:18:57,029 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-05 05:18:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-05 05:18:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-05 05:18:57,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:57,029 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-05 05:18:57,030 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-05 05:18:57,030 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1761568563, now seen corresponding path program 1 times [2022-04-05 05:18:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:57,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693380722] [2022-04-05 05:18:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:57,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:57,071 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-05 05:18:57,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:57,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693380722] [2022-04-05 05:18:57,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693380722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:57,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:57,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 05:18:57,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291677635] [2022-04-05 05:18:57,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:57,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 05:18:57,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:57,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 05:18:57,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 05:18:57,072 INFO L87 Difference]: Start difference. First operand 109 states and 123 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-05 05:18:57,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:57,279 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2022-04-05 05:18:57,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:18:57,280 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-05 05:18:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:57,280 INFO L225 Difference]: With dead ends: 130 [2022-04-05 05:18:57,280 INFO L226 Difference]: Without dead ends: 128 [2022-04-05 05:18:57,281 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-05 05:18:57,281 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:57,281 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 120 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:18:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-05 05:18:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 107. [2022-04-05 05:18:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 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-05 05:18:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-04-05 05:18:57,285 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 18 [2022-04-05 05:18:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:57,285 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-04-05 05:18:57,285 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-05 05:18:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-04-05 05:18:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-05 05:18:57,286 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:57,286 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-05 05:18:57,286 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-05 05:18:57,286 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:57,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1762523925, now seen corresponding path program 1 times [2022-04-05 05:18:57,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:57,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347856612] [2022-04-05 05:18:57,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:57,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:57,392 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-05 05:18:57,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:57,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347856612] [2022-04-05 05:18:57,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347856612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:57,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:57,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:18:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113948958] [2022-04-05 05:18:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:57,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:18:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:18:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:18:57,394 INFO L87 Difference]: Start difference. First operand 107 states and 121 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-05 05:18:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:57,597 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2022-04-05 05:18:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 05:18:57,597 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-05 05:18:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:57,598 INFO L225 Difference]: With dead ends: 117 [2022-04-05 05:18:57,598 INFO L226 Difference]: Without dead ends: 113 [2022-04-05 05:18:57,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-05 05:18:57,598 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 75 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:57,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 217 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:18:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-05 05:18:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-04-05 05:18:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 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-05 05:18:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2022-04-05 05:18:57,602 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 18 [2022-04-05 05:18:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:57,602 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2022-04-05 05:18:57,602 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-05 05:18:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-04-05 05:18:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-05 05:18:57,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:57,603 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-05 05:18:57,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-05 05:18:57,603 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1225947876, now seen corresponding path program 1 times [2022-04-05 05:18:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:57,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760342888] [2022-04-05 05:18:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:57,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:57,698 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-05 05:18:57,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:57,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760342888] [2022-04-05 05:18:57,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760342888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:57,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:57,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:18:57,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225397121] [2022-04-05 05:18:57,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:57,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:18:57,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:57,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:18:57,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:18:57,702 INFO L87 Difference]: Start difference. First operand 108 states and 122 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-05 05:18:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:57,909 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-04-05 05:18:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:18:57,910 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-05 05:18:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:57,910 INFO L225 Difference]: With dead ends: 135 [2022-04-05 05:18:57,910 INFO L226 Difference]: Without dead ends: 133 [2022-04-05 05:18:57,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-05 05:18:57,911 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 95 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:57,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 242 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:18:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-05 05:18:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2022-04-05 05:18:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 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-05 05:18:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-05 05:18:57,915 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 19 [2022-04-05 05:18:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:57,915 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-05 05:18:57,915 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-05 05:18:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-05 05:18:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-05 05:18:57,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:57,916 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-05 05:18:57,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-05 05:18:57,916 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash 620705850, now seen corresponding path program 1 times [2022-04-05 05:18:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:57,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163749898] [2022-04-05 05:18:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:57,946 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-05 05:18:57,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:57,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163749898] [2022-04-05 05:18:57,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163749898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:57,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:57,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:18:57,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731803894] [2022-04-05 05:18:57,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:57,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:18:57,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:57,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:18:57,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:18:57,948 INFO L87 Difference]: Start difference. First operand 111 states and 125 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-05 05:18:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:58,064 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-05 05:18:58,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 05:18:58,064 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-05 05:18:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:58,065 INFO L225 Difference]: With dead ends: 111 [2022-04-05 05:18:58,065 INFO L226 Difference]: Without dead ends: 109 [2022-04-05 05:18:58,065 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-05 05:18:58,066 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 152 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:58,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 115 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:18:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-05 05:18:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-05 05:18:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 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-05 05:18:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-04-05 05:18:58,069 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 20 [2022-04-05 05:18:58,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:58,069 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-04-05 05:18:58,069 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-05 05:18:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-05 05:18:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-05 05:18:58,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:58,070 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-05 05:18:58,070 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-05 05:18:58,070 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2062013697, now seen corresponding path program 1 times [2022-04-05 05:18:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:58,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698278377] [2022-04-05 05:18:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:58,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:58,116 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-05 05:18:58,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:58,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698278377] [2022-04-05 05:18:58,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698278377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:58,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:58,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 05:18:58,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335587740] [2022-04-05 05:18:58,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:58,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 05:18:58,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 05:18:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 05:18:58,117 INFO L87 Difference]: Start difference. First operand 109 states and 123 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-05 05:18:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:58,246 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-05 05:18:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 05:18:58,247 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-05 05:18:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:58,247 INFO L225 Difference]: With dead ends: 109 [2022-04-05 05:18:58,247 INFO L226 Difference]: Without dead ends: 105 [2022-04-05 05:18:58,247 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-05 05:18:58,248 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:58,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:18:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-05 05:18:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-05 05:18:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 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-05 05:18:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-04-05 05:18:58,251 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 21 [2022-04-05 05:18:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:58,251 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-04-05 05:18:58,251 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-05 05:18:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-05 05:18:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-05 05:18:58,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:58,251 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-05 05:18:58,252 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-05 05:18:58,252 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:58,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash -502144601, now seen corresponding path program 1 times [2022-04-05 05:18:58,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:58,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010526466] [2022-04-05 05:18:58,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:58,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:58,302 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-05 05:18:58,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:58,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010526466] [2022-04-05 05:18:58,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010526466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:58,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:58,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:18:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483180074] [2022-04-05 05:18:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:58,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:18:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:58,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:18:58,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:18:58,304 INFO L87 Difference]: Start difference. First operand 105 states and 119 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-05 05:18:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:58,499 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2022-04-05 05:18:58,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:18:58,499 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-05 05:18:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:58,500 INFO L225 Difference]: With dead ends: 121 [2022-04-05 05:18:58,500 INFO L226 Difference]: Without dead ends: 119 [2022-04-05 05:18:58,500 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 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-05 05:18:58,501 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 199 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:58,501 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 80 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:18:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-05 05:18:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-04-05 05:18:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 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-05 05:18:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-04-05 05:18:58,506 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 22 [2022-04-05 05:18:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:58,506 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-04-05 05:18:58,506 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-05 05:18:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-05 05:18:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-05 05:18:58,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:58,509 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-05 05:18:58,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-05 05:18:58,509 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:58,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash 563412161, now seen corresponding path program 1 times [2022-04-05 05:18:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:58,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862113068] [2022-04-05 05:18:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:58,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:58,567 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-05 05:18:58,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:58,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862113068] [2022-04-05 05:18:58,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862113068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:58,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:58,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:18:58,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222025159] [2022-04-05 05:18:58,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:58,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:18:58,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:58,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:18:58,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:18:58,569 INFO L87 Difference]: Start difference. First operand 100 states and 114 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-05 05:18:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:58,803 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-04-05 05:18:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:18:58,803 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-05 05:18:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:58,804 INFO L225 Difference]: With dead ends: 113 [2022-04-05 05:18:58,804 INFO L226 Difference]: Without dead ends: 111 [2022-04-05 05:18:58,804 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-05 05:18:58,805 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 191 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:58,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 74 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 05:18:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-05 05:18:58,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2022-04-05 05:18:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 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-05 05:18:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-04-05 05:18:58,808 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 22 [2022-04-05 05:18:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:58,809 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-04-05 05:18:58,809 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-05 05:18:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-04-05 05:18:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-05 05:18:58,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:58,809 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-05 05:18:58,809 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-05 05:18:58,809 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 564398341, now seen corresponding path program 1 times [2022-04-05 05:18:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:58,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807400820] [2022-04-05 05:18:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:58,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:58,880 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-05 05:18:58,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:58,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807400820] [2022-04-05 05:18:58,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807400820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:58,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:58,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 05:18:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389361409] [2022-04-05 05:18:58,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:58,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 05:18:58,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:58,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 05:18:58,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-05 05:18:58,883 INFO L87 Difference]: Start difference. First operand 95 states and 108 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-05 05:18:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:59,064 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-05 05:18:59,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 05:18:59,065 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-05 05:18:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:59,065 INFO L225 Difference]: With dead ends: 95 [2022-04-05 05:18:59,065 INFO L226 Difference]: Without dead ends: 58 [2022-04-05 05:18:59,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-05 05:18:59,066 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 229 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:59,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 54 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:18:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-05 05:18:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-05 05:18:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 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-05 05:18:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-05 05:18:59,068 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 22 [2022-04-05 05:18:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:59,068 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-05 05:18:59,068 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-05 05:18:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-05 05:18:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-05 05:18:59,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:59,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:18:59,068 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-05 05:18:59,069 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:59,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash 729567653, now seen corresponding path program 1 times [2022-04-05 05:18:59,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:59,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787606227] [2022-04-05 05:18:59,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:59,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:59,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:59,183 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-05 05:18:59,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:59,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787606227] [2022-04-05 05:18:59,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787606227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:59,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:59,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 05:18:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747186665] [2022-04-05 05:18:59,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:59,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 05:18:59,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:59,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 05:18:59,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-05 05:18:59,186 INFO L87 Difference]: Start difference. First operand 58 states and 58 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, (2), 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-05 05:18:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:59,392 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-05 05:18:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-05 05:18:59,393 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, (2), 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 48 [2022-04-05 05:18:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:59,393 INFO L225 Difference]: With dead ends: 58 [2022-04-05 05:18:59,393 INFO L226 Difference]: Without dead ends: 56 [2022-04-05 05:18:59,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-05 05:18:59,394 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 92 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:59,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 53 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:18:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-05 05:18:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-05 05:18:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 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-05 05:18:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-05 05:18:59,396 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2022-04-05 05:18:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:59,396 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-05 05:18:59,396 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, (2), 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-05 05:18:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-05 05:18:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-05 05:18:59,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:59,397 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:18:59,397 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-05 05:18:59,397 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash 729568680, now seen corresponding path program 1 times [2022-04-05 05:18:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:59,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859881617] [2022-04-05 05:18:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:59,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:59,506 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-05 05:18:59,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:59,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859881617] [2022-04-05 05:18:59,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859881617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:59,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:59,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 05:18:59,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374150199] [2022-04-05 05:18:59,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:59,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 05:18:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:59,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 05:18:59,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-05 05:18:59,507 INFO L87 Difference]: Start difference. First operand 56 states and 56 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, (2), 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-05 05:18:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:18:59,742 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-05 05:18:59,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-05 05:18:59,742 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, (2), 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 48 [2022-04-05 05:18:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:18:59,742 INFO L225 Difference]: With dead ends: 63 [2022-04-05 05:18:59,742 INFO L226 Difference]: Without dead ends: 61 [2022-04-05 05:18:59,743 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-05 05:18:59,744 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 96 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:18:59,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 53 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:18:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-05 05:18:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2022-04-05 05:18:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:18:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-05 05:18:59,746 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2022-04-05 05:18:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:18:59,747 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-05 05:18:59,747 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, (2), 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-05 05:18:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-05 05:18:59,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-05 05:18:59,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:18:59,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:18:59,748 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-05 05:18:59,748 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:18:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:18:59,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1141762383, now seen corresponding path program 1 times [2022-04-05 05:18:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:18:59,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999149733] [2022-04-05 05:18:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:18:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:18:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:18:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:18:59,911 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-05 05:18:59,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:18:59,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999149733] [2022-04-05 05:18:59,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999149733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:18:59,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:18:59,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 05:18:59,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825552166] [2022-04-05 05:18:59,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:18:59,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 05:18:59,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:18:59,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 05:18:59,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:18:59,913 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 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-05 05:19:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:00,020 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-05 05:19:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 05:19:00,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-05 05:19:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:00,021 INFO L225 Difference]: With dead ends: 54 [2022-04-05 05:19:00,021 INFO L226 Difference]: Without dead ends: 50 [2022-04-05 05:19:00,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-05 05:19:00,022 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 99 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:00,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 32 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-05 05:19:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-05 05:19:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 05:19:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-05 05:19:00,023 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 49 [2022-04-05 05:19:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:00,024 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-05 05:19:00,024 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 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-05 05:19:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-05 05:19:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-05 05:19:00,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:19:00,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:19:00,024 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-05 05:19:00,024 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 05:19:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:19:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1141794222, now seen corresponding path program 1 times [2022-04-05 05:19:00,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:19:00,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196948911] [2022-04-05 05:19:00,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:19:00,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:19:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:19:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:19:00,118 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-05 05:19:00,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:19:00,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196948911] [2022-04-05 05:19:00,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196948911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:19:00,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:19:00,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 05:19:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336046926] [2022-04-05 05:19:00,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:19:00,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 05:19:00,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:19:00,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 05:19:00,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 05:19:00,120 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 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-05 05:19:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:19:00,215 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-05 05:19:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 05:19:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-05 05:19:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:19:00,215 INFO L225 Difference]: With dead ends: 54 [2022-04-05 05:19:00,215 INFO L226 Difference]: Without dead ends: 0 [2022-04-05 05:19:00,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-05 05:19:00,216 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 87 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 05:19:00,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 36 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 05:19:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-05 05:19:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-05 05:19:00,217 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-05 05:19:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-05 05:19:00,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-05 05:19:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:19:00,217 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-05 05:19:00,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 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-05 05:19:00,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-05 05:19:00,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-05 05:19:00,219 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-05 05:19:00,219 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-05 05:19:00,219 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-05 05:19:00,219 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-05 05:19:00,219 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-05 05:19:00,220 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-05 05:19:00,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-05 05:19:00,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-05 05:19:00,330 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-05 05:19:00,330 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-05 05:19:00,330 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-05 05:19:00,330 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-05 05:19:00,330 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-05 05:19:00,330 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-05 05:19:00,330 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-05 05:19:00,330 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 17 1006) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-05 05:19:00,330 INFO L882 garLoopResultBuilder]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2022-04-05 05:19:00,330 INFO L882 garLoopResultBuilder]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2022-04-05 05:19:00,330 INFO L878 garLoopResultBuilder]: At program point L1004(lines 22 1005) the Hoare annotation is: (or (<= 0 main_~main__t~0) (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|))) [2022-04-05 05:19:00,330 INFO L878 garLoopResultBuilder]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-05 05:19:00,330 INFO L882 garLoopResultBuilder]: For program point L65(lines 65 999) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 17 1006) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L34(lines 34 58) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L72(lines 72 288) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L298(lines 298 997) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 17 1006) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L46(lines 46 56) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L83(lines 83 286) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L309(lines 309 995) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L878 garLoopResultBuilder]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L317(lines 317 994) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L96(lines 96 285) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L325(lines 325 993) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L132(lines 132 284) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L332(lines 332 356) no Hoare annotation was computed. [2022-04-05 05:19:00,331 INFO L882 garLoopResultBuilder]: For program point L366(lines 366 991) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L136(lines 136 242) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L248(lines 248 283) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L343(lines 343 354) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L377(lines 377 989) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L143(lines 143 236) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L878 garLoopResultBuilder]: At program point L282(lines 132 284) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L255(lines 255 277) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L385(lines 385 988) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L155(lines 155 234) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L205(lines 205 231) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L393(lines 393 987) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L164(lines 164 233) no Hoare annotation was computed. [2022-04-05 05:19:00,332 INFO L882 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L217(lines 217 229) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L269(line 269) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L400(lines 400 424) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L434(lines 434 985) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L411(lines 411 422) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L445(lines 445 983) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L453(lines 453 982) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L461(lines 461 981) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L468(lines 468 492) no Hoare annotation was computed. [2022-04-05 05:19:00,333 INFO L882 garLoopResultBuilder]: For program point L502(lines 502 979) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L513(lines 513 977) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L521(lines 521 976) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L529(lines 529 975) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L536(lines 536 560) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L570(lines 570 973) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L547(lines 547 558) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L581(lines 581 971) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L589(lines 589 970) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L597(lines 597 969) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L604(lines 604 628) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L638(lines 638 967) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L615(lines 615 626) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L649(lines 649 965) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L657(lines 657 964) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L665(lines 665 963) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L672(lines 672 696) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L706(lines 706 961) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L683(lines 683 694) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L717(lines 717 959) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L725(lines 725 958) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L733(lines 733 957) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L740(lines 740 764) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L774(lines 774 955) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L751(lines 751 762) no Hoare annotation was computed. [2022-04-05 05:19:00,334 INFO L882 garLoopResultBuilder]: For program point L785(lines 785 953) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L793(lines 793 952) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L801(lines 801 951) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L808(lines 808 832) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L842(lines 842 949) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L819(lines 819 830) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L853(lines 853 947) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L878 garLoopResultBuilder]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L866(lines 866 946) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L874(lines 874 945) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L881(lines 881 907) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L917(lines 917 943) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L883(line 883) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L893(lines 893 905) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L919(line 919) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L929(lines 929 941) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point L931(line 931) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2022-04-05 05:19:00,335 INFO L882 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2022-04-05 05:19:00,337 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] [2022-04-05 05:19:00,338 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 05:19:00,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:19:00 BasicIcfg [2022-04-05 05:19:00,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 05:19:00,349 INFO L158 Benchmark]: Toolchain (without parser) took 6575.90ms. Allocated memory was 186.6MB in the beginning and 275.8MB in the end (delta: 89.1MB). Free memory was 135.8MB in the beginning and 153.3MB in the end (delta: -17.5MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. [2022-04-05 05:19:00,349 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory was 152.3MB in the beginning and 152.2MB in the end (delta: 152.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 05:19:00,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.66ms. Allocated memory is still 186.6MB. Free memory was 135.7MB in the beginning and 153.6MB in the end (delta: -17.9MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-04-05 05:19:00,350 INFO L158 Benchmark]: Boogie Preprocessor took 29.48ms. Allocated memory is still 186.6MB. Free memory was 153.6MB in the beginning and 151.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-05 05:19:00,350 INFO L158 Benchmark]: RCFGBuilder took 456.39ms. Allocated memory is still 186.6MB. Free memory was 151.1MB in the beginning and 126.3MB in the end (delta: 24.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-04-05 05:19:00,350 INFO L158 Benchmark]: IcfgTransformer took 36.43ms. Allocated memory is still 186.6MB. Free memory was 126.3MB in the beginning and 123.4MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-05 05:19:00,350 INFO L158 Benchmark]: TraceAbstraction took 5684.70ms. Allocated memory was 186.6MB in the beginning and 275.8MB in the end (delta: 89.1MB). Free memory was 122.7MB in the beginning and 153.3MB in the end (delta: -30.6MB). Peak memory consumption was 58.9MB. Max. memory is 8.0GB. [2022-04-05 05:19:00,351 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 186.6MB. Free memory was 152.3MB in the beginning and 152.2MB in the end (delta: 152.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 364.66ms. Allocated memory is still 186.6MB. Free memory was 135.7MB in the beginning and 153.6MB in the end (delta: -17.9MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.48ms. Allocated memory is still 186.6MB. Free memory was 153.6MB in the beginning and 151.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 456.39ms. Allocated memory is still 186.6MB. Free memory was 151.1MB in the beginning and 126.3MB in the end (delta: 24.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * IcfgTransformer took 36.43ms. Allocated memory is still 186.6MB. Free memory was 126.3MB in the beginning and 123.4MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5684.70ms. Allocated memory was 186.6MB in the beginning and 275.8MB in the end (delta: 89.1MB). Free memory was 122.7MB in the beginning and 153.3MB in the end (delta: -30.6MB). Peak memory consumption was 58.9MB. 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: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2477 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2477 mSDsluCounter, 2384 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1301 mSDsCounter, 451 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5082 IncrementalHoareTripleChecker+Invalid, 5533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 451 mSolverCounterUnsat, 1083 mSDtfsCounter, 5082 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, InterpolantAutomatonStates: 157, 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, 19 MinimizatonAttempts, 142 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 15 NumberOfFragments, 92 HoareAnnotationTreeSize, 9 FomulaSimplifications, 4665 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 249 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 1724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 0 <= main__t || ((((__tmp_3137_1 == \old(__tmp_3137_1) && __tmp_2624_1 == \old(__tmp_2624_1)) && __tmp_3137_0 == \old(__tmp_3137_0)) && \old(__return_2598) == __return_2598) && __tmp_2624_0 == \old(__tmp_2624_0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len RESULT: Ultimate proved your program to be correct! [2022-04-05 05:19:00,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...