/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 03:11:33,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 03:11:33,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 03:11:33,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 03:11:33,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 03:11:33,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 03:11:33,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 03:11:33,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 03:11:33,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 03:11:33,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 03:11:33,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 03:11:33,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 03:11:33,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 03:11:33,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 03:11:33,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 03:11:33,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 03:11:33,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 03:11:33,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 03:11:33,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 03:11:33,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 03:11:33,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 03:11:33,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 03:11:33,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 03:11:33,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 03:11:33,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 03:11:33,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 03:11:33,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 03:11:33,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 03:11:33,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 03:11:33,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 03:11:33,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 03:11:33,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 03:11:33,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 03:11:33,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 03:11:33,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 03:11:33,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 03:11:33,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 03:11:33,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 03:11:33,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 03:11:33,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 03:11:33,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 03:11:33,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-02-24 03:11:33,971 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 03:11:33,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 03:11:33,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 03:11:33,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 03:11:33,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 03:11:33,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 03:11:33,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 03:11:33,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 03:11:33,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 03:11:33,974 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 03:11:33,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 03:11:33,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 03:11:33,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 03:11:33,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-24 03:11:33,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 03:11:33,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 03:11:33,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 03:11:33,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-24 03:11:33,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 03:11:33,976 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-02-24 03:11:33,976 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-24 03:11:34,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 03:11:34,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 03:11:34,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 03:11:34,180 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 03:11:34,181 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 03:11:34,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-02-24 03:11:34,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf7db779/b5bc8c4c67674d5383e6dbbd8970a0ba/FLAG34c8fdaf6 [2022-02-24 03:11:34,580 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 03:11:34,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-02-24 03:11:34,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf7db779/b5bc8c4c67674d5383e6dbbd8970a0ba/FLAG34c8fdaf6 [2022-02-24 03:11:34,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf7db779/b5bc8c4c67674d5383e6dbbd8970a0ba [2022-02-24 03:11:34,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 03:11:34,991 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-24 03:11:34,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 03:11:34,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 03:11:34,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 03:11:34,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 03:11:34" (1/1) ... [2022-02-24 03:11:35,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d115d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35, skipping insertion in model container [2022-02-24 03:11:35,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 03:11:34" (1/1) ... [2022-02-24 03:11:35,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 03:11:35,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 03:11:35,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-02-24 03:11:35,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-02-24 03:11:35,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-02-24 03:11:35,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-02-24 03:11:35,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-02-24 03:11:35,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-02-24 03:11:35,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-02-24 03:11:35,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-02-24 03:11:35,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-02-24 03:11:35,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-02-24 03:11:35,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-02-24 03:11:35,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-02-24 03:11:35,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-02-24 03:11:35,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-02-24 03:11:35,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-02-24 03:11:35,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-02-24 03:11:35,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-02-24 03:11:35,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-02-24 03:11:35,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 03:11:35,222 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 03:11:35,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-02-24 03:11:35,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-02-24 03:11:35,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-02-24 03:11:35,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-02-24 03:11:35,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-02-24 03:11:35,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-02-24 03:11:35,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-02-24 03:11:35,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-02-24 03:11:35,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-02-24 03:11:35,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-02-24 03:11:35,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-02-24 03:11:35,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-02-24 03:11:35,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-02-24 03:11:35,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-02-24 03:11:35,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-02-24 03:11:35,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-02-24 03:11:35,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-02-24 03:11:35,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-02-24 03:11:35,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 03:11:35,277 INFO L208 MainTranslator]: Completed translation [2022-02-24 03:11:35,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35 WrapperNode [2022-02-24 03:11:35,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 03:11:35,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 03:11:35,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 03:11:35,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 03:11:35,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35" (1/1) ... [2022-02-24 03:11:35,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35" (1/1) ... [2022-02-24 03:11:35,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35" (1/1) ... [2022-02-24 03:11:35,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35" (1/1) ... [2022-02-24 03:11:35,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35" (1/1) ... [2022-02-24 03:11:35,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35" (1/1) ... [2022-02-24 03:11:35,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35" (1/1) ... [2022-02-24 03:11:35,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 03:11:35,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 03:11:35,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 03:11:35,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 03:11:35,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35" (1/1) ... [2022-02-24 03:11:35,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 03:11:35,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 03:11:35,360 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-02-24 03:11:35,386 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-02-24 03:11:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 03:11:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 03:11:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 03:11:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-24 03:11:35,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 03:11:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 03:11:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 03:11:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 03:11:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 03:11:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-24 03:11:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-24 03:11:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 03:11:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 03:11:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 03:11:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 03:11:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 03:11:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 03:11:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 03:11:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 03:11:35,477 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 03:11:35,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 03:11:35,731 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 03:11:35,737 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 03:11:35,737 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-24 03:11:35,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 03:11:35 BoogieIcfgContainer [2022-02-24 03:11:35,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 03:11:35,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 03:11:35,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 03:11:35,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 03:11:35,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 03:11:34" (1/3) ... [2022-02-24 03:11:35,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cc4b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 03:11:35, skipping insertion in model container [2022-02-24 03:11:35,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 03:11:35" (2/3) ... [2022-02-24 03:11:35,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cc4b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 03:11:35, skipping insertion in model container [2022-02-24 03:11:35,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 03:11:35" (3/3) ... [2022-02-24 03:11:35,748 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2022-02-24 03:11:35,752 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-24 03:11:35,752 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-02-24 03:11:35,802 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 03:11:35,812 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=QVASR [2022-02-24 03:11:35,813 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-02-24 03:11:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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-02-24 03:11:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-24 03:11:35,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:35,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:35,856 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:35,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1796468500, now seen corresponding path program 1 times [2022-02-24 03:11:35,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:35,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [817666199] [2022-02-24 03:11:35,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:35,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:35,915 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:36,149 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:36,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [817666199] [2022-02-24 03:11:36,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [817666199] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:36,152 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:36,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 03:11:36,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969179312] [2022-02-24 03:11:36,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:36,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 03:11:36,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:36,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 03:11:36,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-24 03:11:36,188 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:36,484 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-02-24 03:11:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 03:11:36,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-24 03:11:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:36,499 INFO L225 Difference]: With dead ends: 129 [2022-02-24 03:11:36,499 INFO L226 Difference]: Without dead ends: 111 [2022-02-24 03:11:36,503 INFO L932 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-02-24 03:11:36,506 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:36,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 03:11:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-24 03:11:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-02-24 03:11:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-02-24 03:11:36,542 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2022-02-24 03:11:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:36,543 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-02-24 03:11:36,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-02-24 03:11:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-24 03:11:36,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:36,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:36,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 03:11:36,544 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:36,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1799639252, now seen corresponding path program 1 times [2022-02-24 03:11:36,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:36,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [658920941] [2022-02-24 03:11:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:36,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:36,548 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:36,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:36,609 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:36,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [658920941] [2022-02-24 03:11:36,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [658920941] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:36,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:36,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 03:11:36,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328142989] [2022-02-24 03:11:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:36,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 03:11:36,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 03:11:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-24 03:11:36,611 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:36,889 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-02-24 03:11:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 03:11:36,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-24 03:11:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:36,891 INFO L225 Difference]: With dead ends: 111 [2022-02-24 03:11:36,891 INFO L226 Difference]: Without dead ends: 109 [2022-02-24 03:11:36,892 INFO L932 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-02-24 03:11:36,893 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:36,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 218 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 03:11:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-24 03:11:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-02-24 03:11:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 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-02-24 03:11:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-02-24 03:11:36,904 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2022-02-24 03:11:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:36,904 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-02-24 03:11:36,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-24 03:11:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-24 03:11:36,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:36,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:36,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 03:11:36,905 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash -991466384, now seen corresponding path program 1 times [2022-02-24 03:11:36,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:36,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [867961337] [2022-02-24 03:11:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:36,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:36,908 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:36,966 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:36,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [867961337] [2022-02-24 03:11:36,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [867961337] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:36,967 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:36,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 03:11:36,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26290195] [2022-02-24 03:11:36,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:36,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 03:11:36,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:36,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 03:11:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 03:11:36,969 INFO L87 Difference]: Start difference. First operand 71 states and 75 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-02-24 03:11:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:37,130 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-02-24 03:11:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 03:11:37,132 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-02-24 03:11:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:37,136 INFO L225 Difference]: With dead ends: 73 [2022-02-24 03:11:37,136 INFO L226 Difference]: Without dead ends: 71 [2022-02-24 03:11:37,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:37,139 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:37,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 132 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-24 03:11:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-02-24 03:11:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-02-24 03:11:37,162 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2022-02-24 03:11:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:37,162 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-02-24 03:11:37,162 INFO L471 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-02-24 03:11:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-02-24 03:11:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-24 03:11:37,163 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:37,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:37,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 03:11:37,164 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:37,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:37,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1020772778, now seen corresponding path program 1 times [2022-02-24 03:11:37,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:37,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [874193831] [2022-02-24 03:11:37,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:37,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:37,167 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:37,225 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:37,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [874193831] [2022-02-24 03:11:37,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [874193831] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:37,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:37,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 03:11:37,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455697232] [2022-02-24 03:11:37,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:37,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 03:11:37,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:37,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 03:11:37,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 03:11:37,227 INFO L87 Difference]: Start difference. First operand 69 states and 73 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-02-24 03:11:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:37,375 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-02-24 03:11:37,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 03:11:37,375 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-02-24 03:11:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:37,376 INFO L225 Difference]: With dead ends: 71 [2022-02-24 03:11:37,376 INFO L226 Difference]: Without dead ends: 69 [2022-02-24 03:11:37,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:37,382 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:37,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 126 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-24 03:11:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-02-24 03:11:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-02-24 03:11:37,404 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2022-02-24 03:11:37,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:37,404 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-02-24 03:11:37,405 INFO L471 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-02-24 03:11:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-24 03:11:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-24 03:11:37,405 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:37,405 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:37,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 03:11:37,406 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash -670683748, now seen corresponding path program 1 times [2022-02-24 03:11:37,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:37,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014239847] [2022-02-24 03:11:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:37,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:37,408 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:37,469 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:37,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014239847] [2022-02-24 03:11:37,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2014239847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:37,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:37,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 03:11:37,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921737207] [2022-02-24 03:11:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:37,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 03:11:37,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 03:11:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-24 03:11:37,471 INFO L87 Difference]: Start difference. First operand 67 states and 71 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-02-24 03:11:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:37,560 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-02-24 03:11:37,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 03:11:37,560 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-02-24 03:11:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:37,561 INFO L225 Difference]: With dead ends: 69 [2022-02-24 03:11:37,561 INFO L226 Difference]: Without dead ends: 65 [2022-02-24 03:11:37,562 INFO L932 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-02-24 03:11:37,563 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:37,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-24 03:11:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-02-24 03:11:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-02-24 03:11:37,571 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2022-02-24 03:11:37,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:37,571 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-02-24 03:11:37,571 INFO L471 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-02-24 03:11:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-02-24 03:11:37,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-24 03:11:37,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:37,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:37,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 03:11:37,573 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:37,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1578739961, now seen corresponding path program 1 times [2022-02-24 03:11:37,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:37,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484419374] [2022-02-24 03:11:37,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:37,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:37,575 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:37,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:37,621 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:37,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484419374] [2022-02-24 03:11:37,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1484419374] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:37,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:37,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 03:11:37,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107608975] [2022-02-24 03:11:37,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:37,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 03:11:37,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:37,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 03:11:37,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 03:11:37,623 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:37,786 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-02-24 03:11:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 03:11:37,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-24 03:11:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:37,788 INFO L225 Difference]: With dead ends: 108 [2022-02-24 03:11:37,788 INFO L226 Difference]: Without dead ends: 106 [2022-02-24 03:11:37,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:37,789 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:37,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 167 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-24 03:11:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2022-02-24 03:11:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 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-02-24 03:11:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-02-24 03:11:37,797 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 16 [2022-02-24 03:11:37,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:37,798 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-02-24 03:11:37,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-02-24 03:11:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-24 03:11:37,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:37,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:37,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 03:11:37,799 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753863, now seen corresponding path program 1 times [2022-02-24 03:11:37,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:37,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1321418785] [2022-02-24 03:11:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:37,802 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:37,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:37,871 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:37,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1321418785] [2022-02-24 03:11:37,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1321418785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:37,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:37,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 03:11:37,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577646562] [2022-02-24 03:11:37,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:37,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 03:11:37,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:37,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 03:11:37,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 03:11:37,873 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:38,036 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-02-24 03:11:38,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 03:11:38,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-24 03:11:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:38,037 INFO L225 Difference]: With dead ends: 93 [2022-02-24 03:11:38,037 INFO L226 Difference]: Without dead ends: 91 [2022-02-24 03:11:38,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:38,038 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 88 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:38,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 147 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-24 03:11:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-02-24 03:11:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-02-24 03:11:38,046 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2022-02-24 03:11:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:38,046 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-02-24 03:11:38,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-02-24 03:11:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-24 03:11:38,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:38,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:38,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 03:11:38,047 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1579181860, now seen corresponding path program 1 times [2022-02-24 03:11:38,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:38,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2121277327] [2022-02-24 03:11:38,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:38,050 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:38,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:38,089 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:38,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2121277327] [2022-02-24 03:11:38,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2121277327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:38,089 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:38,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 03:11:38,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667876554] [2022-02-24 03:11:38,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:38,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 03:11:38,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:38,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 03:11:38,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-24 03:11:38,091 INFO L87 Difference]: Start difference. First operand 59 states and 63 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-02-24 03:11:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:38,200 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-02-24 03:11:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 03:11:38,200 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-02-24 03:11:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:38,201 INFO L225 Difference]: With dead ends: 61 [2022-02-24 03:11:38,201 INFO L226 Difference]: Without dead ends: 57 [2022-02-24 03:11:38,201 INFO L932 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-02-24 03:11:38,202 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:38,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 129 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-24 03:11:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-02-24 03:11:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-02-24 03:11:38,209 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2022-02-24 03:11:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:38,209 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-02-24 03:11:38,209 INFO L471 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-02-24 03:11:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-02-24 03:11:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-24 03:11:38,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:38,210 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:38,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 03:11:38,210 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:38,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:38,211 INFO L85 PathProgramCache]: Analyzing trace with hash 697862626, now seen corresponding path program 1 times [2022-02-24 03:11:38,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:38,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2085359718] [2022-02-24 03:11:38,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:38,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:38,213 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:38,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:38,255 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:38,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2085359718] [2022-02-24 03:11:38,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2085359718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:38,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:38,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 03:11:38,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613057975] [2022-02-24 03:11:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:38,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 03:11:38,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:38,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 03:11:38,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 03:11:38,257 INFO L87 Difference]: Start difference. First operand 55 states and 59 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-02-24 03:11:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:38,374 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-02-24 03:11:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 03:11:38,375 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-02-24 03:11:38,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:38,375 INFO L225 Difference]: With dead ends: 74 [2022-02-24 03:11:38,376 INFO L226 Difference]: Without dead ends: 72 [2022-02-24 03:11:38,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:38,378 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:38,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 116 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-24 03:11:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-02-24 03:11:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-02-24 03:11:38,386 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2022-02-24 03:11:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:38,387 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-02-24 03:11:38,388 INFO L471 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-02-24 03:11:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-02-24 03:11:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-24 03:11:38,390 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:38,390 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:38,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-24 03:11:38,390 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:38,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:38,391 INFO L85 PathProgramCache]: Analyzing trace with hash 699401826, now seen corresponding path program 1 times [2022-02-24 03:11:38,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:38,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [784574657] [2022-02-24 03:11:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:38,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:38,395 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:38,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:38,459 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:38,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [784574657] [2022-02-24 03:11:38,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [784574657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:38,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:38,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 03:11:38,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222754240] [2022-02-24 03:11:38,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:38,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 03:11:38,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:38,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 03:11:38,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 03:11:38,460 INFO L87 Difference]: Start difference. First operand 53 states and 57 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-02-24 03:11:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:38,561 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-02-24 03:11:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 03:11:38,563 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-02-24 03:11:38,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:38,568 INFO L225 Difference]: With dead ends: 55 [2022-02-24 03:11:38,569 INFO L226 Difference]: Without dead ends: 53 [2022-02-24 03:11:38,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:38,570 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:38,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-24 03:11:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-02-24 03:11:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 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-02-24 03:11:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-02-24 03:11:38,576 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2022-02-24 03:11:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:38,577 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-02-24 03:11:38,577 INFO L471 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-02-24 03:11:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-02-24 03:11:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-24 03:11:38,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:38,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:38,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-24 03:11:38,578 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:38,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1696295318, now seen corresponding path program 1 times [2022-02-24 03:11:38,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:38,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [48092982] [2022-02-24 03:11:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:38,580 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:38,672 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:38,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [48092982] [2022-02-24 03:11:38,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [48092982] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:38,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:38,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 03:11:38,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142021497] [2022-02-24 03:11:38,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:38,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 03:11:38,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:38,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 03:11:38,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-24 03:11:38,674 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:38,849 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-02-24 03:11:38,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 03:11:38,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-24 03:11:38,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:38,851 INFO L225 Difference]: With dead ends: 110 [2022-02-24 03:11:38,851 INFO L226 Difference]: Without dead ends: 108 [2022-02-24 03:11:38,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-24 03:11:38,852 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:38,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 188 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-24 03:11:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2022-02-24 03:11:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-02-24 03:11:38,861 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2022-02-24 03:11:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:38,862 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-02-24 03:11:38,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-02-24 03:11:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-24 03:11:38,864 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:38,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:38,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-24 03:11:38,865 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1696726294, now seen corresponding path program 1 times [2022-02-24 03:11:38,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:38,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2137792815] [2022-02-24 03:11:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:38,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:38,868 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:38,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:38,987 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:38,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2137792815] [2022-02-24 03:11:38,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2137792815] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:38,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:38,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 03:11:38,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168625046] [2022-02-24 03:11:38,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:38,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 03:11:38,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 03:11:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-24 03:11:38,989 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:39,162 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-02-24 03:11:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 03:11:39,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-24 03:11:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:39,164 INFO L225 Difference]: With dead ends: 108 [2022-02-24 03:11:39,164 INFO L226 Difference]: Without dead ends: 106 [2022-02-24 03:11:39,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-24 03:11:39,165 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:39,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 181 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-24 03:11:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2022-02-24 03:11:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-02-24 03:11:39,174 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 17 [2022-02-24 03:11:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:39,175 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-02-24 03:11:39,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-02-24 03:11:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-24 03:11:39,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:39,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:39,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-24 03:11:39,176 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash 160273451, now seen corresponding path program 1 times [2022-02-24 03:11:39,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:39,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1339846702] [2022-02-24 03:11:39,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:39,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:39,178 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:39,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:39,215 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:39,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1339846702] [2022-02-24 03:11:39,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1339846702] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:39,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:39,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 03:11:39,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239426637] [2022-02-24 03:11:39,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:39,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 03:11:39,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:39,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 03:11:39,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-24 03:11:39,217 INFO L87 Difference]: Start difference. First operand 58 states and 63 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-02-24 03:11:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:39,341 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-02-24 03:11:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-24 03:11:39,341 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-02-24 03:11:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:39,342 INFO L225 Difference]: With dead ends: 79 [2022-02-24 03:11:39,342 INFO L226 Difference]: Without dead ends: 77 [2022-02-24 03:11:39,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:39,343 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:39,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 108 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-24 03:11:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-02-24 03:11:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-02-24 03:11:39,369 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2022-02-24 03:11:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:39,369 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-02-24 03:11:39,369 INFO L471 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-02-24 03:11:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-02-24 03:11:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-24 03:11:39,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:39,370 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:39,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-24 03:11:39,371 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash 158908031, now seen corresponding path program 1 times [2022-02-24 03:11:39,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:39,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059870583] [2022-02-24 03:11:39,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:39,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:39,373 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:39,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:39,475 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:39,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059870583] [2022-02-24 03:11:39,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2059870583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:39,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:39,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 03:11:39,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151159273] [2022-02-24 03:11:39,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:39,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 03:11:39,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:39,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 03:11:39,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-24 03:11:39,477 INFO L87 Difference]: Start difference. First operand 56 states and 61 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-02-24 03:11:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:39,608 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-02-24 03:11:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 03:11:39,609 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-02-24 03:11:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:39,611 INFO L225 Difference]: With dead ends: 90 [2022-02-24 03:11:39,611 INFO L226 Difference]: Without dead ends: 88 [2022-02-24 03:11:39,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-24 03:11:39,612 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:39,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 134 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-24 03:11:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2022-02-24 03:11:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 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-02-24 03:11:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-02-24 03:11:39,622 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-02-24 03:11:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:39,622 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-02-24 03:11:39,622 INFO L471 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-02-24 03:11:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-02-24 03:11:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-24 03:11:39,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:39,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:39,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-24 03:11:39,623 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:39,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:39,624 INFO L85 PathProgramCache]: Analyzing trace with hash 206623281, now seen corresponding path program 1 times [2022-02-24 03:11:39,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:39,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1263881958] [2022-02-24 03:11:39,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:39,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:39,625 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:39,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-02-24 03:11:39,698 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:39,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1263881958] [2022-02-24 03:11:39,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1263881958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:39,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:39,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 03:11:39,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025191678] [2022-02-24 03:11:39,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:39,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 03:11:39,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:39,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 03:11:39,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-24 03:11:39,700 INFO L87 Difference]: Start difference. First operand 62 states and 69 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-02-24 03:11:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:39,820 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-02-24 03:11:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 03:11:39,821 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-02-24 03:11:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:39,821 INFO L225 Difference]: With dead ends: 74 [2022-02-24 03:11:39,821 INFO L226 Difference]: Without dead ends: 70 [2022-02-24 03:11:39,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-24 03:11:39,822 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:39,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-24 03:11:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-02-24 03:11:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-02-24 03:11:39,833 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2022-02-24 03:11:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:39,833 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-02-24 03:11:39,833 INFO L471 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-02-24 03:11:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-02-24 03:11:39,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-24 03:11:39,835 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:39,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:39,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-24 03:11:39,836 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:39,837 INFO L85 PathProgramCache]: Analyzing trace with hash 673512821, now seen corresponding path program 1 times [2022-02-24 03:11:39,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:39,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1827118333] [2022-02-24 03:11:39,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:39,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:39,839 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:39,932 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:39,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1827118333] [2022-02-24 03:11:39,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1827118333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:39,932 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:39,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 03:11:39,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929701742] [2022-02-24 03:11:39,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:39,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 03:11:39,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:39,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 03:11:39,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-24 03:11:39,934 INFO L87 Difference]: Start difference. First operand 63 states and 70 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-02-24 03:11:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:40,103 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-02-24 03:11:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 03:11:40,104 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-02-24 03:11:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:40,104 INFO L225 Difference]: With dead ends: 91 [2022-02-24 03:11:40,104 INFO L226 Difference]: Without dead ends: 89 [2022-02-24 03:11:40,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-24 03:11:40,105 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 51 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:40,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 199 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-24 03:11:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-02-24 03:11:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-02-24 03:11:40,116 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2022-02-24 03:11:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:40,116 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-02-24 03:11:40,116 INFO L471 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-02-24 03:11:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-02-24 03:11:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-24 03:11:40,117 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:40,117 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:40,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-24 03:11:40,117 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1908108286, now seen corresponding path program 1 times [2022-02-24 03:11:40,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:40,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1006821980] [2022-02-24 03:11:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:40,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:40,119 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:40,158 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:40,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1006821980] [2022-02-24 03:11:40,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1006821980] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:40,159 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:40,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 03:11:40,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119555920] [2022-02-24 03:11:40,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:40,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 03:11:40,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:40,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 03:11:40,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-24 03:11:40,160 INFO L87 Difference]: Start difference. First operand 66 states and 73 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-02-24 03:11:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:40,229 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-02-24 03:11:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 03:11:40,229 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-02-24 03:11:40,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:40,230 INFO L225 Difference]: With dead ends: 66 [2022-02-24 03:11:40,230 INFO L226 Difference]: Without dead ends: 64 [2022-02-24 03:11:40,230 INFO L932 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-02-24 03:11:40,231 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:40,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 03:11:40,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-24 03:11:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-24 03:11:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-02-24 03:11:40,242 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 20 [2022-02-24 03:11:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:40,243 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-02-24 03:11:40,243 INFO L471 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-02-24 03:11:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-02-24 03:11:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-24 03:11:40,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:40,243 INFO L514 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-02-24 03:11:40,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-24 03:11:40,244 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash 978188398, now seen corresponding path program 1 times [2022-02-24 03:11:40,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:40,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [43923436] [2022-02-24 03:11:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:40,246 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:40,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:40,300 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:40,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [43923436] [2022-02-24 03:11:40,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [43923436] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:40,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:40,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 03:11:40,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913134905] [2022-02-24 03:11:40,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:40,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 03:11:40,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 03:11:40,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-24 03:11:40,301 INFO L87 Difference]: Start difference. First operand 64 states and 71 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-02-24 03:11:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:40,377 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-02-24 03:11:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 03:11:40,378 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-02-24 03:11:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:40,378 INFO L225 Difference]: With dead ends: 64 [2022-02-24 03:11:40,378 INFO L226 Difference]: Without dead ends: 60 [2022-02-24 03:11:40,378 INFO L932 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-02-24 03:11:40,379 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:40,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-24 03:11:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-24 03:11:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-24 03:11:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-02-24 03:11:40,392 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2022-02-24 03:11:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:40,392 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-02-24 03:11:40,393 INFO L471 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-02-24 03:11:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-02-24 03:11:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 03:11:40,393 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:40,393 INFO L514 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-02-24 03:11:40,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-24 03:11:40,393 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 272309526, now seen corresponding path program 1 times [2022-02-24 03:11:40,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:40,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [458351106] [2022-02-24 03:11:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:40,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:40,396 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:40,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:40,449 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:40,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [458351106] [2022-02-24 03:11:40,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [458351106] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:40,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:40,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 03:11:40,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061421288] [2022-02-24 03:11:40,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:40,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 03:11:40,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:40,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 03:11:40,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-24 03:11:40,451 INFO L87 Difference]: Start difference. First operand 60 states and 67 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-02-24 03:11:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:40,605 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-02-24 03:11:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 03:11:40,605 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-02-24 03:11:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:40,606 INFO L225 Difference]: With dead ends: 75 [2022-02-24 03:11:40,606 INFO L226 Difference]: Without dead ends: 73 [2022-02-24 03:11:40,606 INFO L932 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-02-24 03:11:40,607 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 111 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:40,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 62 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-24 03:11:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2022-02-24 03:11:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-02-24 03:11:40,620 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2022-02-24 03:11:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:40,620 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-02-24 03:11:40,620 INFO L471 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-02-24 03:11:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-02-24 03:11:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 03:11:40,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:40,621 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:40,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-24 03:11:40,621 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1682587452, now seen corresponding path program 1 times [2022-02-24 03:11:40,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:40,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141914066] [2022-02-24 03:11:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:40,623 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:40,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:40,679 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:40,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141914066] [2022-02-24 03:11:40,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1141914066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:40,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:40,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 03:11:40,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547949610] [2022-02-24 03:11:40,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:40,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 03:11:40,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:40,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 03:11:40,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:40,681 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-02-24 03:11:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:40,811 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-02-24 03:11:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 03:11:40,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-02-24 03:11:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:40,812 INFO L225 Difference]: With dead ends: 72 [2022-02-24 03:11:40,812 INFO L226 Difference]: Without dead ends: 70 [2022-02-24 03:11:40,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-24 03:11:40,813 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:40,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 60 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:40,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-24 03:11:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2022-02-24 03:11:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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-02-24 03:11:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-02-24 03:11:40,824 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2022-02-24 03:11:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:40,824 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-02-24 03:11:40,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-02-24 03:11:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-02-24 03:11:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-24 03:11:40,825 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:40,825 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:40,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-24 03:11:40,825 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1683018428, now seen corresponding path program 1 times [2022-02-24 03:11:40,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:40,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [442321043] [2022-02-24 03:11:40,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:40,827 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:40,883 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:40,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [442321043] [2022-02-24 03:11:40,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [442321043] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:40,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:40,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 03:11:40,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296514631] [2022-02-24 03:11:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:40,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 03:11:40,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 03:11:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:40,884 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-02-24 03:11:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:41,004 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-02-24 03:11:41,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 03:11:41,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-02-24 03:11:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:41,005 INFO L225 Difference]: With dead ends: 67 [2022-02-24 03:11:41,005 INFO L226 Difference]: Without dead ends: 65 [2022-02-24 03:11:41,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-24 03:11:41,006 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 88 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:41,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 48 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-24 03:11:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2022-02-24 03:11:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 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-02-24 03:11:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-02-24 03:11:41,017 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2022-02-24 03:11:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:41,017 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-02-24 03:11:41,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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-02-24 03:11:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-24 03:11:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 03:11:41,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:41,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:41,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-24 03:11:41,018 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:41,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1184340980, now seen corresponding path program 1 times [2022-02-24 03:11:41,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:41,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1505583710] [2022-02-24 03:11:41,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:41,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:41,020 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:41,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:41,076 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:41,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1505583710] [2022-02-24 03:11:41,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1505583710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:41,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:41,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 03:11:41,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874717085] [2022-02-24 03:11:41,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:41,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 03:11:41,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:41,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 03:11:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:41,078 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:41,194 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-02-24 03:11:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 03:11:41,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-24 03:11:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:41,200 INFO L225 Difference]: With dead ends: 56 [2022-02-24 03:11:41,200 INFO L226 Difference]: Without dead ends: 54 [2022-02-24 03:11:41,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-24 03:11:41,202 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:41,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 58 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-24 03:11:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-02-24 03:11:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-02-24 03:11:41,211 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-02-24 03:11:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:41,211 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-02-24 03:11:41,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-02-24 03:11:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-24 03:11:41,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 03:11:41,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:11:41,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-24 03:11:41,212 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-24 03:11:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 03:11:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1136625730, now seen corresponding path program 1 times [2022-02-24 03:11:41,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-24 03:11:41,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1085244060] [2022-02-24 03:11:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 03:11:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 03:11:41,215 INFO L213 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-24 03:11:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 03:11:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 03:11:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 03:11:41,295 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-24 03:11:41,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1085244060] [2022-02-24 03:11:41,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1085244060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 03:11:41,295 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 03:11:41,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 03:11:41,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104037358] [2022-02-24 03:11:41,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 03:11:41,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 03:11:41,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-24 03:11:41,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 03:11:41,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 03:11:41,297 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 03:11:41,393 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-24 03:11:41,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 03:11:41,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-24 03:11:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 03:11:41,393 INFO L225 Difference]: With dead ends: 39 [2022-02-24 03:11:41,393 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 03:11:41,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-24 03:11:41,394 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 72 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-24 03:11:41,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 43 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-24 03:11:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 03:11:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 03:11:41,395 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-02-24 03:11:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 03:11:41,395 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-02-24 03:11:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 03:11:41,395 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 03:11:41,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-24 03:11:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 03:11:41,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 03:11:41,398 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-02-24 03:11:41,398 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-02-24 03:11:41,398 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-02-24 03:11:41,398 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-02-24 03:11:41,399 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-02-24 03:11:41,399 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-02-24 03:11:41,399 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-02-24 03:11:41,399 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-02-24 03:11:41,399 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-02-24 03:11:41,399 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-02-24 03:11:41,399 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-02-24 03:11:41,399 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-02-24 03:11:41,400 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-02-24 03:11:41,400 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-02-24 03:11:41,400 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-02-24 03:11:41,400 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-02-24 03:11:41,400 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-02-24 03:11:41,400 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-02-24 03:11:41,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-24 03:11:41,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-24 03:11:52,003 WARN L232 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 62 DAG size of output: 62 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-24 03:12:08,986 WARN L232 SmtUtils]: Spent 14.29s on a formula simplification. DAG size of input: 76 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-24 03:12:12,834 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-02-24 03:12:12,834 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-02-24 03:12:12,835 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-02-24 03:12:12,835 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-02-24 03:12:12,835 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-24 03:12:12,835 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-02-24 03:12:12,835 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-02-24 03:12:12,835 INFO L854 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) the Hoare annotation is: false [2022-02-24 03:12:12,835 INFO L854 garLoopResultBuilder]: At program point L126(line 126) the Hoare annotation is: false [2022-02-24 03:12:12,835 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 15 402) the Hoare annotation is: true [2022-02-24 03:12:12,836 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: false [2022-02-24 03:12:12,836 INFO L854 garLoopResultBuilder]: At program point L176(line 176) the Hoare annotation is: false [2022-02-24 03:12:12,836 INFO L854 garLoopResultBuilder]: At program point L366(line 366) the Hoare annotation is: false [2022-02-24 03:12:12,836 INFO L854 garLoopResultBuilder]: At program point L333(line 333) the Hoare annotation is: false [2022-02-24 03:12:12,836 INFO L854 garLoopResultBuilder]: At program point L234(lines 234 242) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 0)) .cse2))) [2022-02-24 03:12:12,836 INFO L854 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) the Hoare annotation is: false [2022-02-24 03:12:12,836 INFO L854 garLoopResultBuilder]: At program point L152(lines 152 160) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,836 INFO L854 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) the Hoare annotation is: false [2022-02-24 03:12:12,836 INFO L854 garLoopResultBuilder]: At program point L309(line 309) the Hoare annotation is: false [2022-02-24 03:12:12,836 INFO L854 garLoopResultBuilder]: At program point L20(lines 20 401) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-02-24 03:12:12,837 INFO L854 garLoopResultBuilder]: At program point L276(lines 276 391) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,837 INFO L854 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) the Hoare annotation is: false [2022-02-24 03:12:12,837 INFO L854 garLoopResultBuilder]: At program point L70(lines 70 94) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,837 INFO L854 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (and (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 (<= 1 main_~main__t~0)) (and .cse3 .cse1))))) (or (and .cse2 (not (= main_~__VERIFIER_assert__cond~18 0))) (and .cse2 .cse1))))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~19 0))) (and .cse0 .cse1)))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-02-24 03:12:12,837 INFO L854 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) (and (= main_~main__t~0 0) (< 0 main_~main__tagbuf_len~0))) [2022-02-24 03:12:12,837 INFO L854 garLoopResultBuilder]: At program point L186(lines 186 196) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-24 03:12:12,837 INFO L854 garLoopResultBuilder]: At program point L376(lines 376 385) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~18 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~19 0))) [2022-02-24 03:12:12,837 INFO L854 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) the Hoare annotation is: false [2022-02-24 03:12:12,838 INFO L854 garLoopResultBuilder]: At program point L343(lines 343 352) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~17 0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-24 03:12:12,838 INFO L854 garLoopResultBuilder]: At program point L112(lines 112 203) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-24 03:12:12,838 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 15 402) the Hoare annotation is: true [2022-02-24 03:12:12,838 INFO L854 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: false [2022-02-24 03:12:12,838 INFO L854 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) the Hoare annotation is: false [2022-02-24 03:12:12,838 INFO L854 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,838 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) the Hoare annotation is: false [2022-02-24 03:12:12,838 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 15 402) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-02-24 03:12:12,838 INFO L854 garLoopResultBuilder]: At program point L154(line 154) the Hoare annotation is: false [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point L278(line 278) the Hoare annotation is: false [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) the Hoare annotation is: false [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point L105(lines 105 209) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: false [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point L39(lines 39 255) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point L295(lines 295 317) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) the Hoare annotation is: false [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point L188(line 188) the Hoare annotation is: false [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point L378(line 378) the Hoare annotation is: false [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point L345(line 345) the Hoare annotation is: false [2022-02-24 03:12:12,839 INFO L854 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) the Hoare annotation is: false [2022-02-24 03:12:12,840 INFO L854 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: false [2022-02-24 03:12:12,840 INFO L854 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) the Hoare annotation is: false [2022-02-24 03:12:12,840 INFO L854 garLoopResultBuilder]: At program point L32(lines 32 395) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,840 INFO L854 garLoopResultBuilder]: At program point L288(lines 288 390) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,840 INFO L854 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) the Hoare annotation is: false [2022-02-24 03:12:12,840 INFO L854 garLoopResultBuilder]: At program point L222(lines 222 244) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 (not (<= main_~main__tagbuf_len~0 0)) .cse1) (and .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1))) [2022-02-24 03:12:12,840 INFO L854 garLoopResultBuilder]: At program point L24(lines 24 396) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,840 INFO L854 garLoopResultBuilder]: At program point L82(lines 82 92) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,840 INFO L854 garLoopResultBuilder]: At program point L140(lines 140 162) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,841 INFO L854 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) the Hoare annotation is: false [2022-02-24 03:12:12,841 INFO L854 garLoopResultBuilder]: At program point L297(line 297) the Hoare annotation is: false [2022-02-24 03:12:12,841 INFO L854 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) the Hoare annotation is: false [2022-02-24 03:12:12,841 INFO L854 garLoopResultBuilder]: At program point L124(lines 124 201) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-24 03:12:12,841 INFO L861 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2022-02-24 03:12:12,841 INFO L854 garLoopResultBuilder]: At program point L215(lines 215 250) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-24 03:12:12,841 INFO L854 garLoopResultBuilder]: At program point L50(lines 50 253) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,841 INFO L854 garLoopResultBuilder]: At program point L174(lines 174 198) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-24 03:12:12,841 INFO L854 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) the Hoare annotation is: false [2022-02-24 03:12:12,842 INFO L854 garLoopResultBuilder]: At program point L364(lines 364 387) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~18 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-02-24 03:12:12,842 INFO L854 garLoopResultBuilder]: At program point L331(lines 331 354) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-24 03:12:12,842 INFO L854 garLoopResultBuilder]: At program point L265(lines 265 393) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,842 INFO L854 garLoopResultBuilder]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) the Hoare annotation is: false [2022-02-24 03:12:12,842 INFO L854 garLoopResultBuilder]: At program point L133(lines 133 200) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-24 03:12:12,842 INFO L854 garLoopResultBuilder]: At program point L224(line 224) the Hoare annotation is: false [2022-02-24 03:12:12,842 INFO L854 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) the Hoare annotation is: false [2022-02-24 03:12:12,842 INFO L854 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-24 03:12:12,842 INFO L854 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: false [2022-02-24 03:12:12,842 INFO L854 garLoopResultBuilder]: At program point L307(lines 307 315) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-02-24 03:12:12,843 INFO L854 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) the Hoare annotation is: false [2022-02-24 03:12:12,843 INFO L854 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: false [2022-02-24 03:12:12,843 INFO L854 garLoopResultBuilder]: At program point L101(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-24 03:12:12,843 INFO L854 garLoopResultBuilder]: At program point L324(lines 324 389) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0)))))) [2022-02-24 03:12:12,843 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-24 03:12:12,843 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-24 03:12:12,843 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-24 03:12:12,843 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-24 03:12:12,843 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-24 03:12:12,843 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-24 03:12:12,843 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-24 03:12:12,846 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 03:12:12,847 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-24 03:12:12,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 03:12:12 BoogieIcfgContainer [2022-02-24 03:12:12,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-24 03:12:12,861 INFO L158 Benchmark]: Toolchain (without parser) took 37870.32ms. Allocated memory was 189.8MB in the beginning and 580.9MB in the end (delta: 391.1MB). Free memory was 132.1MB in the beginning and 512.3MB in the end (delta: -380.2MB). Peak memory consumption was 322.9MB. Max. memory is 8.0GB. [2022-02-24 03:12:12,861 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-24 03:12:12,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.13ms. Allocated memory was 189.8MB in the beginning and 231.7MB in the end (delta: 41.9MB). Free memory was 132.0MB in the beginning and 196.6MB in the end (delta: -64.6MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-02-24 03:12:12,862 INFO L158 Benchmark]: Boogie Preprocessor took 46.05ms. Allocated memory is still 231.7MB. Free memory was 196.6MB in the beginning and 194.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-24 03:12:12,862 INFO L158 Benchmark]: RCFGBuilder took 413.18ms. Allocated memory is still 231.7MB. Free memory was 194.5MB in the beginning and 179.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-02-24 03:12:12,863 INFO L158 Benchmark]: TraceAbstraction took 37120.55ms. Allocated memory was 231.7MB in the beginning and 580.9MB in the end (delta: 349.2MB). Free memory was 179.3MB in the beginning and 512.3MB in the end (delta: -333.0MB). Peak memory consumption was 329.2MB. Max. memory is 8.0GB. [2022-02-24 03:12:12,864 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.13ms. Allocated memory was 189.8MB in the beginning and 231.7MB in the end (delta: 41.9MB). Free memory was 132.0MB in the beginning and 196.6MB in the end (delta: -64.6MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.05ms. Allocated memory is still 231.7MB. Free memory was 196.6MB in the beginning and 194.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 413.18ms. Allocated memory is still 231.7MB. Free memory was 194.5MB in the beginning and 179.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 37120.55ms. Allocated memory was 231.7MB in the beginning and 580.9MB in the end (delta: 349.2MB). Free memory was 179.3MB in the beginning and 512.3MB in the end (delta: -333.0MB). Peak memory consumption was 329.2MB. 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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 37.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 31.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1442 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1442 mSDsluCounter, 2848 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1755 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3304 IncrementalHoareTripleChecker+Invalid, 3464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 1093 mSDtfsCounter, 3304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 432 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 80 PreInvPairs, 97 NumberOfFragments, 799 HoareAnnotationTreeSize, 80 FomulaSimplifications, 1699038 FormulaSimplificationTreeSizeReduction, 30.1s HoareSimplificationTime, 80 FomulaSimplificationsInter, 2584793 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && (((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) && 1 <= main__t) || (main__t == 0 && 0 < main__tagbuf_len) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && main__t == 0)) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-02-24 03:12:12,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...