/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 02:25:35,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 02:25:35,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 02:25:35,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 02:25:35,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 02:25:35,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 02:25:35,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 02:25:35,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 02:25:35,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 02:25:35,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 02:25:35,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 02:25:35,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 02:25:35,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 02:25:35,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 02:25:35,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 02:25:35,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 02:25:35,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 02:25:35,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 02:25:35,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 02:25:35,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 02:25:35,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 02:25:35,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 02:25:35,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 02:25:35,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 02:25:35,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 02:25:35,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 02:25:35,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 02:25:35,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 02:25:35,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 02:25:35,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 02:25:35,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 02:25:35,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 02:25:35,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 02:25:35,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 02:25:35,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 02:25:35,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 02:25:35,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 02:25:35,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 02:25:35,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 02:25:35,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 02:25:35,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 02:25:35,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-31 02:25:35,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 02:25:35,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 02:25:35,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 02:25:35,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 02:25:35,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 02:25:35,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 02:25:35,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 02:25:35,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 02:25:35,370 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 02:25:35,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 02:25:35,371 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 02:25:35,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 02:25:35,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 02:25:35,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 02:25:35,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 02:25:35,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 02:25:35,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 02:25:35,371 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 02:25:35,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 02:25:35,371 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 02:25:35,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 02:25:35,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 02:25:35,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 02:25:35,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 02:25:35,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 02:25:35,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 02:25:35,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 02:25:35,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 02:25:35,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 02:25:35,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 02:25:35,373 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 02:25:35,373 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 02:25:35,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 02:25:35,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 02:25:35,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 02:25:35,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 02:25:35,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 02:25:35,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 02:25:35,575 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 02:25:35,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-01-31 02:25:35,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910de4e18/0e37d9bd1b584c8b861eefa0c9e183fe/FLAGd83f1aa9e [2022-01-31 02:25:36,013 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 02:25:36,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-01-31 02:25:36,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910de4e18/0e37d9bd1b584c8b861eefa0c9e183fe/FLAGd83f1aa9e [2022-01-31 02:25:36,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910de4e18/0e37d9bd1b584c8b861eefa0c9e183fe [2022-01-31 02:25:36,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 02:25:36,055 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 02:25:36,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 02:25:36,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 02:25:36,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 02:25:36,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:25:36" (1/1) ... [2022-01-31 02:25:36,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147aa574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36, skipping insertion in model container [2022-01-31 02:25:36,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:25:36" (1/1) ... [2022-01-31 02:25:36,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 02:25:36,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 02:25:36,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-01-31 02:25:36,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.p+lhb-reducer.c[1134,1147] [2022-01-31 02:25:36,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.p+lhb-reducer.c[2208,2221] [2022-01-31 02:25:36,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.p+lhb-reducer.c[2423,2436] [2022-01-31 02:25:36,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-01-31 02:25:36,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-01-31 02:25:36,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.p+lhb-reducer.c[3435,3448] [2022-01-31 02:25:36,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-01-31 02:25:36,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-01-31 02:25:36,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-01-31 02:25:36,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-01-31 02:25:36,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-01-31 02:25:36,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-01-31 02:25:36,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-01-31 02:25:36,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-01-31 02:25:36,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-01-31 02:25:36,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 02:25:36,312 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 02:25:36,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-01-31 02:25:36,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-01-31 02:25:36,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-01-31 02:25:36,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-01-31 02:25:36,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-01-31 02:25:36,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-01-31 02:25:36,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-01-31 02:25:36,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-01-31 02:25:36,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-01-31 02:25:36,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-01-31 02:25:36,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-01-31 02:25:36,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-01-31 02:25:36,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-01-31 02:25:36,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-01-31 02:25:36,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-01-31 02:25:36,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-01-31 02:25:36,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 02:25:36,394 INFO L208 MainTranslator]: Completed translation [2022-01-31 02:25:36,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36 WrapperNode [2022-01-31 02:25:36,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 02:25:36,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 02:25:36,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 02:25:36,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 02:25:36,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36" (1/1) ... [2022-01-31 02:25:36,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36" (1/1) ... [2022-01-31 02:25:36,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36" (1/1) ... [2022-01-31 02:25:36,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36" (1/1) ... [2022-01-31 02:25:36,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36" (1/1) ... [2022-01-31 02:25:36,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36" (1/1) ... [2022-01-31 02:25:36,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36" (1/1) ... [2022-01-31 02:25:36,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 02:25:36,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 02:25:36,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 02:25:36,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 02:25:36,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36" (1/1) ... [2022-01-31 02:25:36,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 02:25:36,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:25:36,480 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-01-31 02:25:36,523 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-01-31 02:25:36,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 02:25:36,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 02:25:36,533 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 02:25:36,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 02:25:36,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 02:25:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 02:25:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 02:25:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 02:25:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 02:25:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 02:25:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 02:25:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 02:25:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 02:25:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 02:25:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 02:25:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 02:25:36,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 02:25:36,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 02:25:36,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 02:25:36,666 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 02:25:36,668 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 02:25:37,003 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 02:25:37,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 02:25:37,008 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 02:25:37,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:37 BoogieIcfgContainer [2022-01-31 02:25:37,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 02:25:37,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 02:25:37,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 02:25:37,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 02:25:37,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 02:25:36" (1/3) ... [2022-01-31 02:25:37,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b9bb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:25:37, skipping insertion in model container [2022-01-31 02:25:37,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:36" (2/3) ... [2022-01-31 02:25:37,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b9bb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:25:37, skipping insertion in model container [2022-01-31 02:25:37,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:37" (3/3) ... [2022-01-31 02:25:37,017 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2022-01-31 02:25:37,021 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 02:25:37,021 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-01-31 02:25:37,058 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 02:25:37,064 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 02:25:37,064 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-01-31 02:25:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 02:25:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 02:25:37,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:37,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:37,092 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1600664684, now seen corresponding path program 1 times [2022-01-31 02:25:37,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:37,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23167586] [2022-01-31 02:25:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:37,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:37,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:37,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:37,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23167586] [2022-01-31 02:25:37,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23167586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:37,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:37,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:37,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459450774] [2022-01-31 02:25:37,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:37,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:37,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:37,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:37,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:37,356 INFO L87 Difference]: Start difference. First operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:37,714 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2022-01-31 02:25:37,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:37,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-01-31 02:25:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:37,725 INFO L225 Difference]: With dead ends: 143 [2022-01-31 02:25:37,725 INFO L226 Difference]: Without dead ends: 123 [2022-01-31 02:25:37,728 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-01-31 02:25:37,732 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 269 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:37,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 118 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 02:25:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-31 02:25:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2022-01-31 02:25:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2022-01-31 02:25:37,781 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2022-01-31 02:25:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:37,781 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2022-01-31 02:25:37,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-01-31 02:25:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 02:25:37,784 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:37,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:37,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 02:25:37,784 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1919005414, now seen corresponding path program 1 times [2022-01-31 02:25:37,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:37,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133078493] [2022-01-31 02:25:37,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:37,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:37,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:37,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:37,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133078493] [2022-01-31 02:25:37,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133078493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:37,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:37,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:37,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502949294] [2022-01-31 02:25:37,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:37,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:37,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:37,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:37,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:37,888 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:38,178 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2022-01-31 02:25:38,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:38,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-01-31 02:25:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:38,180 INFO L225 Difference]: With dead ends: 121 [2022-01-31 02:25:38,180 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 02:25:38,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:38,181 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 85 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:38,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 248 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:25:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 02:25:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-01-31 02:25:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-01-31 02:25:38,187 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2022-01-31 02:25:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:38,187 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-01-31 02:25:38,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-01-31 02:25:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 02:25:38,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:38,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:38,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 02:25:38,188 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:38,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1908131676, now seen corresponding path program 1 times [2022-01-31 02:25:38,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:38,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089192957] [2022-01-31 02:25:38,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:38,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:38,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:38,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089192957] [2022-01-31 02:25:38,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089192957] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:38,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:38,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:38,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769705133] [2022-01-31 02:25:38,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:38,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:38,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:38,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:38,245 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:38,454 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-01-31 02:25:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:38,455 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-01-31 02:25:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:38,456 INFO L225 Difference]: With dead ends: 113 [2022-01-31 02:25:38,456 INFO L226 Difference]: Without dead ends: 111 [2022-01-31 02:25:38,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:38,457 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 140 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:38,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 118 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:25:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-31 02:25:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-01-31 02:25:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-01-31 02:25:38,463 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2022-01-31 02:25:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:38,464 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-01-31 02:25:38,464 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-01-31 02:25:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-01-31 02:25:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 02:25:38,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:38,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:38,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 02:25:38,465 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:38,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash -977457091, now seen corresponding path program 1 times [2022-01-31 02:25:38,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:38,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256946973] [2022-01-31 02:25:38,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:38,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:38,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:38,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256946973] [2022-01-31 02:25:38,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256946973] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:38,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:38,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:38,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659196543] [2022-01-31 02:25:38,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:38,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:38,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:38,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:38,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:38,524 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:38,711 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-01-31 02:25:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:38,712 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-01-31 02:25:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:38,714 INFO L225 Difference]: With dead ends: 111 [2022-01-31 02:25:38,714 INFO L226 Difference]: Without dead ends: 107 [2022-01-31 02:25:38,714 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-01-31 02:25:38,718 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:38,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:25:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-31 02:25:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-01-31 02:25:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-01-31 02:25:38,731 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2022-01-31 02:25:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:38,732 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-01-31 02:25:38,732 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-01-31 02:25:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-01-31 02:25:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 02:25:38,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:38,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:38,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 02:25:38,733 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:38,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash -223130707, now seen corresponding path program 1 times [2022-01-31 02:25:38,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:38,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211661906] [2022-01-31 02:25:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:38,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:38,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:38,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211661906] [2022-01-31 02:25:38,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211661906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:38,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:38,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:38,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984491742] [2022-01-31 02:25:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:38,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:38,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:38,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:38,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:38,801 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:39,013 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2022-01-31 02:25:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:39,013 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-01-31 02:25:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:39,014 INFO L225 Difference]: With dead ends: 125 [2022-01-31 02:25:39,014 INFO L226 Difference]: Without dead ends: 123 [2022-01-31 02:25:39,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:39,015 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 157 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:39,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 128 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:25:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-31 02:25:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-01-31 02:25:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-01-31 02:25:39,020 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2022-01-31 02:25:39,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:39,020 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-01-31 02:25:39,020 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-01-31 02:25:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-01-31 02:25:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 02:25:39,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:39,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:39,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 02:25:39,021 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:39,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash -221591507, now seen corresponding path program 1 times [2022-01-31 02:25:39,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:39,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696063868] [2022-01-31 02:25:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:39,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:39,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:39,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696063868] [2022-01-31 02:25:39,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696063868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:39,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:39,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:39,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997642508] [2022-01-31 02:25:39,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:39,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:39,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:39,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:39,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:39,101 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:39,309 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-01-31 02:25:39,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:39,310 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-01-31 02:25:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:39,310 INFO L225 Difference]: With dead ends: 105 [2022-01-31 02:25:39,310 INFO L226 Difference]: Without dead ends: 103 [2022-01-31 02:25:39,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:39,311 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 130 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:39,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 100 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:25:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-31 02:25:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-01-31 02:25:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-01-31 02:25:39,316 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2022-01-31 02:25:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:39,316 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-01-31 02:25:39,316 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-01-31 02:25:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-01-31 02:25:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 02:25:39,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:39,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:39,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 02:25:39,317 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1674251212, now seen corresponding path program 1 times [2022-01-31 02:25:39,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:39,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343492194] [2022-01-31 02:25:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:39,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:39,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:39,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:39,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343492194] [2022-01-31 02:25:39,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343492194] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:39,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:39,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:39,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894804515] [2022-01-31 02:25:39,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:39,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:39,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:39,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:39,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:39,397 INFO L87 Difference]: Start difference. First operand 103 states and 115 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-01-31 02:25:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:39,622 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-01-31 02:25:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:39,622 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-01-31 02:25:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:39,623 INFO L225 Difference]: With dead ends: 124 [2022-01-31 02:25:39,623 INFO L226 Difference]: Without dead ends: 122 [2022-01-31 02:25:39,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:39,625 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:39,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 120 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:25:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-01-31 02:25:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2022-01-31 02:25:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 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-01-31 02:25:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2022-01-31 02:25:39,635 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2022-01-31 02:25:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:39,636 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2022-01-31 02:25:39,636 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-01-31 02:25:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2022-01-31 02:25:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 02:25:39,636 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:39,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:39,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 02:25:39,637 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:39,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1672885792, now seen corresponding path program 1 times [2022-01-31 02:25:39,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:39,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136263388] [2022-01-31 02:25:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:39,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:39,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:39,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136263388] [2022-01-31 02:25:39,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136263388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:39,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:39,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:39,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643862621] [2022-01-31 02:25:39,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:39,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:39,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:39,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:39,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:39,782 INFO L87 Difference]: Start difference. First operand 101 states and 113 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-01-31 02:25:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:40,038 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-01-31 02:25:40,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:25:40,038 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-01-31 02:25:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:40,039 INFO L225 Difference]: With dead ends: 134 [2022-01-31 02:25:40,039 INFO L226 Difference]: Without dead ends: 132 [2022-01-31 02:25:40,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:40,040 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 100 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:40,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 252 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:25:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-01-31 02:25:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2022-01-31 02:25:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-01-31 02:25:40,046 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 18 [2022-01-31 02:25:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:40,046 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-01-31 02:25:40,046 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-01-31 02:25:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-01-31 02:25:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 02:25:40,047 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:40,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:40,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 02:25:40,047 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:40,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:40,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1720601042, now seen corresponding path program 1 times [2022-01-31 02:25:40,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:40,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873177700] [2022-01-31 02:25:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:40,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:40,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:40,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873177700] [2022-01-31 02:25:40,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873177700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:40,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:40,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:40,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973045193] [2022-01-31 02:25:40,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:40,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:40,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:40,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:40,124 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:40,333 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2022-01-31 02:25:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:40,333 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-01-31 02:25:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:40,334 INFO L225 Difference]: With dead ends: 117 [2022-01-31 02:25:40,334 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 02:25:40,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:40,335 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 75 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:40,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 217 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:25:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 02:25:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-01-31 02:25:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2022-01-31 02:25:40,338 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 18 [2022-01-31 02:25:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:40,338 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2022-01-31 02:25:40,338 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-01-31 02:25:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-01-31 02:25:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 02:25:40,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:40,339 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-01-31 02:25:40,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 02:25:40,339 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:40,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash 362183168, now seen corresponding path program 1 times [2022-01-31 02:25:40,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:40,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623630350] [2022-01-31 02:25:40,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:40,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:40,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:40,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:40,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623630350] [2022-01-31 02:25:40,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623630350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:40,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:40,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:40,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657028433] [2022-01-31 02:25:40,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:40,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:40,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:40,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:40,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:40,413 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:40,625 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-01-31 02:25:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:25:40,625 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-01-31 02:25:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:40,626 INFO L225 Difference]: With dead ends: 135 [2022-01-31 02:25:40,626 INFO L226 Difference]: Without dead ends: 133 [2022-01-31 02:25:40,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:40,627 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 97 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:40,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 242 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:25:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-31 02:25:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2022-01-31 02:25:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-01-31 02:25:40,630 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 19 [2022-01-31 02:25:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:40,630 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-01-31 02:25:40,630 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-01-31 02:25:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-01-31 02:25:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 02:25:40,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:40,631 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-01-31 02:25:40,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 02:25:40,631 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:40,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1325574371, now seen corresponding path program 1 times [2022-01-31 02:25:40,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:40,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422465703] [2022-01-31 02:25:40,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:40,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:40,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:40,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:40,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422465703] [2022-01-31 02:25:40,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422465703] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:40,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:40,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:40,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601998094] [2022-01-31 02:25:40,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:40,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:40,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:40,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:40,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:40,685 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:40,795 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-01-31 02:25:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:40,795 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-01-31 02:25:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:40,796 INFO L225 Difference]: With dead ends: 111 [2022-01-31 02:25:40,796 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 02:25:40,796 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-01-31 02:25:40,797 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 152 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:40,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 115 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 02:25:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-01-31 02:25:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-01-31 02:25:40,800 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 20 [2022-01-31 02:25:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:40,800 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-01-31 02:25:40,800 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-01-31 02:25:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-01-31 02:25:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 02:25:40,801 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:40,801 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-01-31 02:25:40,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 02:25:40,801 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:40,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1856864327, now seen corresponding path program 1 times [2022-01-31 02:25:40,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:40,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911668087] [2022-01-31 02:25:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:40,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:40,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:40,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:40,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911668087] [2022-01-31 02:25:40,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911668087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:40,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:40,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:40,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477623437] [2022-01-31 02:25:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:40,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:40,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:40,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:40,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:40,835 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:40,959 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-01-31 02:25:40,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:40,960 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-01-31 02:25:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:40,960 INFO L225 Difference]: With dead ends: 109 [2022-01-31 02:25:40,960 INFO L226 Difference]: Without dead ends: 105 [2022-01-31 02:25:40,961 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-01-31 02:25:40,961 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:40,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-31 02:25:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-01-31 02:25:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-01-31 02:25:40,964 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 21 [2022-01-31 02:25:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:40,964 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-01-31 02:25:40,964 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-01-31 02:25:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-01-31 02:25:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 02:25:40,965 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:40,965 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-01-31 02:25:40,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 02:25:40,965 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:40,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1714979017, now seen corresponding path program 1 times [2022-01-31 02:25:40,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:40,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274591172] [2022-01-31 02:25:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:40,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:41,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:41,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:41,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274591172] [2022-01-31 02:25:41,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274591172] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:41,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:41,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:41,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583546464] [2022-01-31 02:25:41,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:41,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:41,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:41,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:41,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:41,014 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:41,224 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2022-01-31 02:25:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:25:41,225 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-01-31 02:25:41,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:41,225 INFO L225 Difference]: With dead ends: 121 [2022-01-31 02:25:41,225 INFO L226 Difference]: Without dead ends: 119 [2022-01-31 02:25:41,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 02:25:41,226 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:41,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 72 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-01-31 02:25:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-01-31 02:25:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-01-31 02:25:41,229 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 22 [2022-01-31 02:25:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:41,229 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-01-31 02:25:41,229 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-01-31 02:25:41,229 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-01-31 02:25:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 02:25:41,230 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:41,230 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-01-31 02:25:41,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 02:25:41,230 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:41,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:41,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1738536758, now seen corresponding path program 1 times [2022-01-31 02:25:41,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:41,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976923710] [2022-01-31 02:25:41,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:41,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:41,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:41,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976923710] [2022-01-31 02:25:41,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976923710] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:41,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:41,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:41,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569984304] [2022-01-31 02:25:41,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:41,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:41,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:41,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:41,311 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:41,512 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-01-31 02:25:41,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:25:41,512 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-01-31 02:25:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:41,512 INFO L225 Difference]: With dead ends: 113 [2022-01-31 02:25:41,512 INFO L226 Difference]: Without dead ends: 111 [2022-01-31 02:25:41,513 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-01-31 02:25:41,513 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 249 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:41,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 66 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-31 02:25:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2022-01-31 02:25:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-01-31 02:25:41,518 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 22 [2022-01-31 02:25:41,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:41,518 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-01-31 02:25:41,518 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-01-31 02:25:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-01-31 02:25:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 02:25:41,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:41,520 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-01-31 02:25:41,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 02:25:41,520 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1786252008, now seen corresponding path program 1 times [2022-01-31 02:25:41,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:41,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855290155] [2022-01-31 02:25:41,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:41,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:41,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:41,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855290155] [2022-01-31 02:25:41,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855290155] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:41,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:41,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:41,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627063715] [2022-01-31 02:25:41,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:41,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:41,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:41,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:41,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:41,587 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:41,768 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-01-31 02:25:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:41,768 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-01-31 02:25:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:41,770 INFO L225 Difference]: With dead ends: 95 [2022-01-31 02:25:41,770 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 02:25:41,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:41,772 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 229 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:41,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 54 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 02:25:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-01-31 02:25:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-01-31 02:25:41,775 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 22 [2022-01-31 02:25:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:41,775 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-01-31 02:25:41,775 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-01-31 02:25:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-01-31 02:25:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 02:25:41,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:41,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:41,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 02:25:41,776 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:41,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:41,777 INFO L85 PathProgramCache]: Analyzing trace with hash -563432656, now seen corresponding path program 1 times [2022-01-31 02:25:41,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:41,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882366431] [2022-01-31 02:25:41,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:41,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:41,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:41,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:41,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882366431] [2022-01-31 02:25:41,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882366431] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:41,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:41,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 02:25:41,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252807697] [2022-01-31 02:25:41,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:41,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 02:25:41,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:41,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 02:25:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-31 02:25:41,914 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:42,127 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-01-31 02:25:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 02:25:42,127 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-01-31 02:25:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:42,128 INFO L225 Difference]: With dead ends: 67 [2022-01-31 02:25:42,128 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 02:25:42,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-01-31 02:25:42,128 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 125 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:42,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 63 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 02:25:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-01-31 02:25:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-01-31 02:25:42,132 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2022-01-31 02:25:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:42,132 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-01-31 02:25:42,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-01-31 02:25:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 02:25:42,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:42,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:42,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 02:25:42,133 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:42,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:42,133 INFO L85 PathProgramCache]: Analyzing trace with hash -563446558, now seen corresponding path program 1 times [2022-01-31 02:25:42,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:42,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944557219] [2022-01-31 02:25:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:42,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:42,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:42,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944557219] [2022-01-31 02:25:42,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944557219] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:42,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:42,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 02:25:42,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408809443] [2022-01-31 02:25:42,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:42,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 02:25:42,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:42,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 02:25:42,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-31 02:25:42,254 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:42,460 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-01-31 02:25:42,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 02:25:42,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-01-31 02:25:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:42,461 INFO L225 Difference]: With dead ends: 56 [2022-01-31 02:25:42,461 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 02:25:42,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-01-31 02:25:42,461 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 99 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:42,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 47 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 02:25:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-01-31 02:25:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-01-31 02:25:42,463 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2022-01-31 02:25:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:42,463 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-01-31 02:25:42,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-01-31 02:25:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 02:25:42,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:42,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:42,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 02:25:42,464 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash -286539729, now seen corresponding path program 1 times [2022-01-31 02:25:42,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:42,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33502744] [2022-01-31 02:25:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:42,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:42,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:42,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33502744] [2022-01-31 02:25:42,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33502744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:42,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:42,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 02:25:42,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630552585] [2022-01-31 02:25:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:42,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 02:25:42,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:42,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 02:25:42,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:25:42,563 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:42,664 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-01-31 02:25:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:25:42,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-01-31 02:25:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:42,665 INFO L225 Difference]: With dead ends: 62 [2022-01-31 02:25:42,665 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 02:25:42,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 02:25:42,665 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 124 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:42,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 35 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 02:25:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-01-31 02:25:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-01-31 02:25:42,668 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2022-01-31 02:25:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:42,668 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-01-31 02:25:42,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-01-31 02:25:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 02:25:42,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:42,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:42,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 02:25:42,669 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:42,669 INFO L85 PathProgramCache]: Analyzing trace with hash -286970705, now seen corresponding path program 1 times [2022-01-31 02:25:42,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:42,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163266006] [2022-01-31 02:25:42,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:42,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:42,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:42,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163266006] [2022-01-31 02:25:42,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163266006] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:42,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:42,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 02:25:42,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495175879] [2022-01-31 02:25:42,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:42,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 02:25:42,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:42,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 02:25:42,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:25:42,786 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:42,874 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-01-31 02:25:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:42,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-01-31 02:25:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:42,875 INFO L225 Difference]: With dead ends: 52 [2022-01-31 02:25:42,875 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 02:25:42,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:25:42,876 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 93 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:42,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 27 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 02:25:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 02:25:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 02:25:42,877 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-01-31 02:25:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 02:25:42,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-01-31 02:25:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:42,877 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 02:25:42,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 02:25:42,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 02:25:42,879 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-01-31 02:25:42,879 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-01-31 02:25:42,879 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-01-31 02:25:42,880 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-01-31 02:25:42,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-01-31 02:25:42,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-01-31 02:25:42,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-01-31 02:25:42,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-01-31 02:25:42,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-01-31 02:25:42,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-01-31 02:25:42,881 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-01-31 02:25:42,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-01-31 02:25:42,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-01-31 02:25:42,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-01-31 02:25:42,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-01-31 02:25:42,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-01-31 02:25:42,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 02:25:42,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 02:25:43,022 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-01-31 02:25:43,022 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-01-31 02:25:43,023 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-01-31 02:25:43,023 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:25:43,023 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-01-31 02:25:43,023 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:25:43,023 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:25:43,023 INFO L858 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-01-31 02:25:43,023 INFO L858 garLoopResultBuilder]: For program point L217(lines 217 229) no Hoare annotation was computed. [2022-01-31 02:25:43,023 INFO L858 garLoopResultBuilder]: For program point mainEXIT(lines 17 1006) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L597(lines 597 969) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L366(lines 366 991) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L581(lines 581 971) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L317(lines 317 994) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 424) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 242) no Hoare annotation was computed. [2022-01-31 02:25:43,024 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L615(lines 615 626) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L929(lines 929 941) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L665(lines 665 963) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L434(lines 434 985) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L269(line 269) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point mainFINAL(lines 17 1006) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L649(lines 649 965) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L385(lines 385 988) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 492) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L881(lines 881 907) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-01-31 02:25:43,025 INFO L858 garLoopResultBuilder]: For program point L683(lines 683 694) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 288) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L931(line 931) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L733(lines 733 957) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 234) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L502(lines 502 979) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 231) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L717(lines 717 959) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L453(lines 453 982) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L866(lines 866 946) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 277) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L536(lines 536 560) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L883(line 883) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L751(lines 751 762) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L801(lines 801 951) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-01-31 02:25:43,026 INFO L858 garLoopResultBuilder]: For program point L570(lines 570 973) no Hoare annotation was computed. [2022-01-31 02:25:43,027 INFO L858 garLoopResultBuilder]: For program point L917(lines 917 943) no Hoare annotation was computed. [2022-01-31 02:25:43,027 INFO L858 garLoopResultBuilder]: For program point L785(lines 785 953) no Hoare annotation was computed. [2022-01-31 02:25:43,027 INFO L858 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-01-31 02:25:43,027 INFO L858 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-01-31 02:25:43,027 INFO L858 garLoopResultBuilder]: For program point L521(lines 521 976) no Hoare annotation was computed. [2022-01-31 02:25:43,028 INFO L854 garLoopResultBuilder]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 02:25:43,028 INFO L858 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2022-01-31 02:25:43,028 INFO L858 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-01-31 02:25:43,028 INFO L858 garLoopResultBuilder]: For program point L604(lines 604 628) no Hoare annotation was computed. [2022-01-31 02:25:43,028 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2022-01-31 02:25:43,028 INFO L858 garLoopResultBuilder]: For program point L819(lines 819 830) no Hoare annotation was computed. [2022-01-31 02:25:43,028 INFO L858 garLoopResultBuilder]: For program point L638(lines 638 967) no Hoare annotation was computed. [2022-01-31 02:25:43,028 INFO L858 garLoopResultBuilder]: For program point L919(line 919) no Hoare annotation was computed. [2022-01-31 02:25:43,028 INFO L858 garLoopResultBuilder]: For program point L853(lines 853 947) no Hoare annotation was computed. [2022-01-31 02:25:43,028 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 236) no Hoare annotation was computed. [2022-01-31 02:25:43,028 INFO L858 garLoopResultBuilder]: For program point L589(lines 589 970) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L325(lines 325 993) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L672(lines 672 696) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 995) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L854 garLoopResultBuilder]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L706(lines 706 961) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 354) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L657(lines 657 964) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L46(lines 46 56) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L854 garLoopResultBuilder]: At program point L1004(lines 22 1005) the Hoare annotation is: (or (<= 0 main_~main__t~0) (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|))) [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L393(lines 393 987) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L740(lines 740 764) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 285) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 17 1006) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L377(lines 377 989) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L774(lines 774 955) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point L411(lines 411 422) no Hoare annotation was computed. [2022-01-31 02:25:43,029 INFO L858 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L725(lines 725 958) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 981) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L854 garLoopResultBuilder]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L874(lines 874 945) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L808(lines 808 832) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 233) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 999) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L445(lines 445 983) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L842(lines 842 949) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 284) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L793(lines 793 952) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 283) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 286) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L529(lines 529 975) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 997) no Hoare annotation was computed. [2022-01-31 02:25:43,030 INFO L858 garLoopResultBuilder]: For program point L34(lines 34 58) no Hoare annotation was computed. [2022-01-31 02:25:43,031 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 977) no Hoare annotation was computed. [2022-01-31 02:25:43,031 INFO L858 garLoopResultBuilder]: For program point L893(lines 893 905) no Hoare annotation was computed. [2022-01-31 02:25:43,031 INFO L854 garLoopResultBuilder]: At program point L282(lines 132 284) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-01-31 02:25:43,031 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-01-31 02:25:43,031 INFO L858 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-01-31 02:25:43,031 INFO L858 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2022-01-31 02:25:43,031 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 356) no Hoare annotation was computed. [2022-01-31 02:25:43,031 INFO L858 garLoopResultBuilder]: For program point L547(lines 547 558) no Hoare annotation was computed. [2022-01-31 02:25:43,031 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-01-31 02:25:43,032 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 02:25:43,032 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-01-31 02:25:43,032 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-31 02:25:43,032 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 02:25:43,032 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 02:25:43,032 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-31 02:25:43,035 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] [2022-01-31 02:25:43,037 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 02:25:43,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:25:43 BoogieIcfgContainer [2022-01-31 02:25:43,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 02:25:43,062 INFO L158 Benchmark]: Toolchain (without parser) took 7006.68ms. Allocated memory was 192.9MB in the beginning and 239.1MB in the end (delta: 46.1MB). Free memory was 144.9MB in the beginning and 185.5MB in the end (delta: -40.5MB). Peak memory consumption was 111.7MB. Max. memory is 8.0GB. [2022-01-31 02:25:43,062 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 02:25:43,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.41ms. Allocated memory is still 192.9MB. Free memory was 144.8MB in the beginning and 160.3MB in the end (delta: -15.6MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-01-31 02:25:43,062 INFO L158 Benchmark]: Boogie Preprocessor took 44.92ms. Allocated memory is still 192.9MB. Free memory was 160.3MB in the beginning and 158.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 02:25:43,062 INFO L158 Benchmark]: RCFGBuilder took 568.74ms. Allocated memory is still 192.9MB. Free memory was 158.0MB in the beginning and 132.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-01-31 02:25:43,065 INFO L158 Benchmark]: TraceAbstraction took 6050.02ms. Allocated memory was 192.9MB in the beginning and 239.1MB in the end (delta: 46.1MB). Free memory was 132.3MB in the beginning and 185.5MB in the end (delta: -53.2MB). Peak memory consumption was 98.8MB. Max. memory is 8.0GB. [2022-01-31 02:25:43,068 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.12ms. Allocated memory is still 192.9MB. Free memory is still 161.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 338.41ms. Allocated memory is still 192.9MB. Free memory was 144.8MB in the beginning and 160.3MB in the end (delta: -15.6MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.92ms. Allocated memory is still 192.9MB. Free memory was 160.3MB in the beginning and 158.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 568.74ms. Allocated memory is still 192.9MB. Free memory was 158.0MB in the beginning and 132.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 6050.02ms. Allocated memory was 192.9MB in the beginning and 239.1MB in the end (delta: 46.1MB). Free memory was 132.3MB in the beginning and 185.5MB in the end (delta: -53.2MB). Peak memory consumption was 98.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 132 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2655 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2655 mSDsluCounter, 2392 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1309 mSDsCounter, 485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5093 IncrementalHoareTripleChecker+Invalid, 5578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 485 mSolverCounterUnsat, 1083 mSDtfsCounter, 5093 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 148 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 92 HoareAnnotationTreeSize, 9 FomulaSimplifications, 4450 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 261 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 1720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 0 <= main__t || ((((__tmp_3137_1 == \old(__tmp_3137_1) && __tmp_2624_1 == \old(__tmp_2624_1)) && __tmp_3137_0 == \old(__tmp_3137_0)) && \old(__return_2598) == __return_2598) && __tmp_2624_0 == \old(__tmp_2624_0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len RESULT: Ultimate proved your program to be correct! [2022-01-31 02:25:43,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...