/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 03:53:12,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 03:53:12,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 03:53:12,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 03:53:12,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 03:53:12,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 03:53:12,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 03:53:12,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 03:53:12,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 03:53:12,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 03:53:12,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 03:53:12,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 03:53:12,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 03:53:12,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 03:53:12,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 03:53:12,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 03:53:12,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 03:53:12,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 03:53:12,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 03:53:12,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 03:53:12,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 03:53:12,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 03:53:12,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 03:53:12,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 03:53:12,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 03:53:12,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 03:53:12,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 03:53:12,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 03:53:12,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 03:53:12,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 03:53:12,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 03:53:12,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 03:53:12,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 03:53:12,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 03:53:12,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 03:53:12,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 03:53:12,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 03:53:12,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 03:53:12,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 03:53:12,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 03:53:12,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 03:53:12,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-02-15 03:53:12,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 03:53:12,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 03:53:12,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 03:53:12,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 03:53:12,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 03:53:12,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 03:53:12,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 03:53:12,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 03:53:12,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 03:53:12,336 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 03:53:12,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 03:53:12,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 03:53:12,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 03:53:12,337 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 03:53:12,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 03:53:12,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 03:53:12,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 03:53:12,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 03:53:12,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 03:53:12,338 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-02-15 03:53:12,338 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-15 03:53:12,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 03:53:12,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 03:53:12,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 03:53:12,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 03:53:12,574 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 03:53:12,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-02-15 03:53:12,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2d1ba09/fa04bd87fb724c4ebefc2566c9d47b1e/FLAGd844e0732 [2022-02-15 03:53:13,066 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 03:53:13,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-02-15 03:53:13,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2d1ba09/fa04bd87fb724c4ebefc2566c9d47b1e/FLAGd844e0732 [2022-02-15 03:53:13,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2d1ba09/fa04bd87fb724c4ebefc2566c9d47b1e [2022-02-15 03:53:13,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 03:53:13,088 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 03:53:13,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 03:53:13,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 03:53:13,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 03:53:13,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 03:53:13" (1/1) ... [2022-02-15 03:53:13,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35da496b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13, skipping insertion in model container [2022-02-15 03:53:13,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 03:53:13" (1/1) ... [2022-02-15 03:53:13,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 03:53:13,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 03:53:13,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-02-15 03:53:13,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.v+lhb-reducer.c[1636,1649] [2022-02-15 03:53:13,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.v+lhb-reducer.c[1851,1864] [2022-02-15 03:53:13,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.v+lhb-reducer.c[2384,2397] [2022-02-15 03:53:13,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-02-15 03:53:13,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-02-15 03:53:13,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-02-15 03:53:13,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-02-15 03:53:13,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-02-15 03:53:13,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-02-15 03:53:13,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-02-15 03:53:13,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-02-15 03:53:13,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.v+lhb-reducer.c[5203,5216] [2022-02-15 03:53:13,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-02-15 03:53:13,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-02-15 03:53:13,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-02-15 03:53:13,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-02-15 03:53:13,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.v+lhb-reducer.c[6514,6527] [2022-02-15 03:53:13,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 03:53:13,339 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 03:53:13,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-02-15 03:53:13,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-02-15 03:53:13,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-02-15 03:53:13,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-02-15 03:53:13,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-02-15 03:53:13,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-02-15 03:53:13,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-02-15 03:53:13,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-02-15 03:53:13,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-02-15 03:53:13,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-02-15 03:53:13,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-02-15 03:53:13,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-02-15 03:53:13,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-02-15 03:53:13,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-02-15 03:53:13,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-02-15 03:53:13,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.v+lhb-reducer.c[6010,6023] [2022-02-15 03:53:13,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.v+lhb-reducer.c[6296,6309] [2022-02-15 03:53:13,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.v+lhb-reducer.c[6514,6527] [2022-02-15 03:53:13,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 03:53:13,397 INFO L208 MainTranslator]: Completed translation [2022-02-15 03:53:13,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13 WrapperNode [2022-02-15 03:53:13,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 03:53:13,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 03:53:13,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 03:53:13,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 03:53:13,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13" (1/1) ... [2022-02-15 03:53:13,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13" (1/1) ... [2022-02-15 03:53:13,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13" (1/1) ... [2022-02-15 03:53:13,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13" (1/1) ... [2022-02-15 03:53:13,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13" (1/1) ... [2022-02-15 03:53:13,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13" (1/1) ... [2022-02-15 03:53:13,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13" (1/1) ... [2022-02-15 03:53:13,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 03:53:13,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 03:53:13,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 03:53:13,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 03:53:13,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13" (1/1) ... [2022-02-15 03:53:13,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 03:53:13,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 03:53:13,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 03:53:13,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 03:53:13,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 03:53:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 03:53:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 03:53:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-15 03:53:13,521 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 03:53:13,521 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 03:53:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 03:53:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 03:53:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 03:53:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-15 03:53:13,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 03:53:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 03:53:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 03:53:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 03:53:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 03:53:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 03:53:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 03:53:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 03:53:13,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 03:53:13,617 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 03:53:13,618 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 03:53:13,835 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 03:53:13,843 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 03:53:13,843 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-15 03:53:13,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 03:53:13 BoogieIcfgContainer [2022-02-15 03:53:13,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 03:53:13,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 03:53:13,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 03:53:13,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 03:53:13,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 03:53:13" (1/3) ... [2022-02-15 03:53:13,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270f55c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 03:53:13, skipping insertion in model container [2022-02-15 03:53:13,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:53:13" (2/3) ... [2022-02-15 03:53:13,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270f55c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 03:53:13, skipping insertion in model container [2022-02-15 03:53:13,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 03:53:13" (3/3) ... [2022-02-15 03:53:13,856 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2022-02-15 03:53:13,862 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 03:53:13,862 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-02-15 03:53:13,906 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 03:53:13,917 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=QVASR [2022-02-15 03:53:13,917 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-02-15 03:53:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:53:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-15 03:53:13,939 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:13,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:13,944 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1796468500, now seen corresponding path program 1 times [2022-02-15 03:53:13,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:13,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113127135] [2022-02-15 03:53:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:13,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:14,003 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:14,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:14,219 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:14,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2113127135] [2022-02-15 03:53:14,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2113127135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:14,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:14,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 03:53:14,222 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997867778] [2022-02-15 03:53:14,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:14,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 03:53:14,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:14,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 03:53:14,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 03:53:14,251 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:14,481 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-02-15 03:53:14,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 03:53:14,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-15 03:53:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:14,493 INFO L225 Difference]: With dead ends: 129 [2022-02-15 03:53:14,493 INFO L226 Difference]: Without dead ends: 111 [2022-02-15 03:53:14,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:14,506 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:14,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-15 03:53:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-02-15 03:53:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-02-15 03:53:14,541 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2022-02-15 03:53:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:14,541 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-02-15 03:53:14,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-02-15 03:53:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-15 03:53:14,542 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:14,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:14,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 03:53:14,543 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:14,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:14,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1799639252, now seen corresponding path program 1 times [2022-02-15 03:53:14,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:14,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1468538739] [2022-02-15 03:53:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:14,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:14,547 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:14,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:14,609 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:14,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1468538739] [2022-02-15 03:53:14,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1468538739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:14,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:14,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 03:53:14,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686716288] [2022-02-15 03:53:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:14,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 03:53:14,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:14,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 03:53:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 03:53:14,612 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:14,781 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-02-15 03:53:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 03:53:14,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-15 03:53:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:14,785 INFO L225 Difference]: With dead ends: 111 [2022-02-15 03:53:14,785 INFO L226 Difference]: Without dead ends: 109 [2022-02-15 03:53:14,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:14,787 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:14,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 218 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-15 03:53:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-02-15 03:53:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-02-15 03:53:14,807 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2022-02-15 03:53:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:14,807 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-02-15 03:53:14,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-02-15 03:53:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-15 03:53:14,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:14,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:14,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 03:53:14,809 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:14,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:14,809 INFO L85 PathProgramCache]: Analyzing trace with hash -991466384, now seen corresponding path program 1 times [2022-02-15 03:53:14,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:14,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [569854052] [2022-02-15 03:53:14,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:14,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:14,812 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:14,871 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:14,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [569854052] [2022-02-15 03:53:14,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [569854052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:14,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:14,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 03:53:14,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230065903] [2022-02-15 03:53:14,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:14,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 03:53:14,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 03:53:14,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 03:53:14,873 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:15,035 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-02-15 03:53:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 03:53:15,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-15 03:53:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:15,041 INFO L225 Difference]: With dead ends: 73 [2022-02-15 03:53:15,041 INFO L226 Difference]: Without dead ends: 71 [2022-02-15 03:53:15,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:15,044 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:15,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 132 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-15 03:53:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-02-15 03:53:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-02-15 03:53:15,064 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2022-02-15 03:53:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:15,064 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-02-15 03:53:15,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-02-15 03:53:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-15 03:53:15,065 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:15,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:15,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 03:53:15,065 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:15,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1020772778, now seen corresponding path program 1 times [2022-02-15 03:53:15,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:15,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219373727] [2022-02-15 03:53:15,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:15,068 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:15,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:15,146 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:15,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219373727] [2022-02-15 03:53:15,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [219373727] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:15,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:15,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 03:53:15,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501371932] [2022-02-15 03:53:15,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:15,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 03:53:15,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 03:53:15,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 03:53:15,149 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:15,288 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-02-15 03:53:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 03:53:15,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-15 03:53:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:15,289 INFO L225 Difference]: With dead ends: 71 [2022-02-15 03:53:15,289 INFO L226 Difference]: Without dead ends: 69 [2022-02-15 03:53:15,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:15,290 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:15,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 126 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-15 03:53:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-02-15 03:53:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-02-15 03:53:15,299 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2022-02-15 03:53:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:15,300 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-02-15 03:53:15,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-15 03:53:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 03:53:15,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:15,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:15,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 03:53:15,301 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash -670683748, now seen corresponding path program 1 times [2022-02-15 03:53:15,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:15,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [341549749] [2022-02-15 03:53:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:15,304 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:15,379 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:15,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [341549749] [2022-02-15 03:53:15,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [341549749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:15,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:15,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 03:53:15,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195530445] [2022-02-15 03:53:15,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:15,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 03:53:15,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:15,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 03:53:15,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 03:53:15,381 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:15,484 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-02-15 03:53:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 03:53:15,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-15 03:53:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:15,485 INFO L225 Difference]: With dead ends: 69 [2022-02-15 03:53:15,485 INFO L226 Difference]: Without dead ends: 65 [2022-02-15 03:53:15,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:53:15,486 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:15,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-15 03:53:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-02-15 03:53:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-02-15 03:53:15,497 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2022-02-15 03:53:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:15,498 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-02-15 03:53:15,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-02-15 03:53:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 03:53:15,499 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:15,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:15,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 03:53:15,500 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:15,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1578739961, now seen corresponding path program 1 times [2022-02-15 03:53:15,501 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:15,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1747411281] [2022-02-15 03:53:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:15,503 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:15,582 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:15,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1747411281] [2022-02-15 03:53:15,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1747411281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:15,583 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:15,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 03:53:15,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056300213] [2022-02-15 03:53:15,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:15,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 03:53:15,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:15,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 03:53:15,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 03:53:15,585 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:15,766 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-02-15 03:53:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 03:53:15,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-15 03:53:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:15,767 INFO L225 Difference]: With dead ends: 108 [2022-02-15 03:53:15,767 INFO L226 Difference]: Without dead ends: 106 [2022-02-15 03:53:15,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:15,769 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:15,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 167 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-15 03:53:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2022-02-15 03:53:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-02-15 03:53:15,782 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 16 [2022-02-15 03:53:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:15,783 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-02-15 03:53:15,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-02-15 03:53:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 03:53:15,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:15,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:15,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 03:53:15,784 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1578753863, now seen corresponding path program 1 times [2022-02-15 03:53:15,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:15,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [611513146] [2022-02-15 03:53:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:15,787 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:15,849 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:15,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [611513146] [2022-02-15 03:53:15,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [611513146] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:15,850 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:15,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 03:53:15,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471601624] [2022-02-15 03:53:15,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:15,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 03:53:15,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:15,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 03:53:15,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 03:53:15,851 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:16,014 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-02-15 03:53:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 03:53:16,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-15 03:53:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:16,016 INFO L225 Difference]: With dead ends: 93 [2022-02-15 03:53:16,016 INFO L226 Difference]: Without dead ends: 91 [2022-02-15 03:53:16,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:16,017 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 88 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:16,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 147 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-15 03:53:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-02-15 03:53:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-02-15 03:53:16,027 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2022-02-15 03:53:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:16,029 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-02-15 03:53:16,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-02-15 03:53:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-15 03:53:16,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:16,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:16,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 03:53:16,038 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:16,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1579181860, now seen corresponding path program 1 times [2022-02-15 03:53:16,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:16,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1550103368] [2022-02-15 03:53:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:16,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:16,042 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:16,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:16,093 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:16,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1550103368] [2022-02-15 03:53:16,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1550103368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:16,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:16,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 03:53:16,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146150023] [2022-02-15 03:53:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:16,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 03:53:16,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:16,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 03:53:16,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 03:53:16,095 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:16,183 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-02-15 03:53:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 03:53:16,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-15 03:53:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:16,185 INFO L225 Difference]: With dead ends: 61 [2022-02-15 03:53:16,185 INFO L226 Difference]: Without dead ends: 57 [2022-02-15 03:53:16,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:53:16,186 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:16,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 129 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-15 03:53:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-02-15 03:53:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-02-15 03:53:16,200 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2022-02-15 03:53:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:16,200 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-02-15 03:53:16,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-02-15 03:53:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 03:53:16,202 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:16,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:16,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 03:53:16,203 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash 697862626, now seen corresponding path program 1 times [2022-02-15 03:53:16,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:16,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1858506135] [2022-02-15 03:53:16,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:16,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:16,206 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:16,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:16,285 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:16,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1858506135] [2022-02-15 03:53:16,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1858506135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:16,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:16,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 03:53:16,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381043432] [2022-02-15 03:53:16,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:16,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 03:53:16,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:16,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 03:53:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 03:53:16,287 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:16,421 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-02-15 03:53:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 03:53:16,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-15 03:53:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:16,422 INFO L225 Difference]: With dead ends: 74 [2022-02-15 03:53:16,422 INFO L226 Difference]: Without dead ends: 72 [2022-02-15 03:53:16,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:16,424 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:16,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 116 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-15 03:53:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-02-15 03:53:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-02-15 03:53:16,431 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2022-02-15 03:53:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:16,433 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-02-15 03:53:16,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-02-15 03:53:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 03:53:16,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:16,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:16,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 03:53:16,435 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:16,435 INFO L85 PathProgramCache]: Analyzing trace with hash 699401826, now seen corresponding path program 1 times [2022-02-15 03:53:16,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:16,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1746674046] [2022-02-15 03:53:16,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:16,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:16,437 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:16,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:16,498 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:16,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1746674046] [2022-02-15 03:53:16,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1746674046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:16,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:16,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 03:53:16,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029577614] [2022-02-15 03:53:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:16,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 03:53:16,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:16,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 03:53:16,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 03:53:16,500 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:16,622 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-02-15 03:53:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 03:53:16,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-15 03:53:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:16,626 INFO L225 Difference]: With dead ends: 55 [2022-02-15 03:53:16,626 INFO L226 Difference]: Without dead ends: 53 [2022-02-15 03:53:16,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:16,627 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:16,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:16,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-15 03:53:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-02-15 03:53:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-02-15 03:53:16,634 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2022-02-15 03:53:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:16,635 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-02-15 03:53:16,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-02-15 03:53:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 03:53:16,636 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:16,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:16,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 03:53:16,637 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1696295318, now seen corresponding path program 1 times [2022-02-15 03:53:16,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:16,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [357256073] [2022-02-15 03:53:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:16,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:16,640 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:16,772 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:16,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [357256073] [2022-02-15 03:53:16,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [357256073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:16,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:16,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 03:53:16,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545701187] [2022-02-15 03:53:16,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:16,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 03:53:16,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:16,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 03:53:16,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:53:16,774 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:16,954 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-02-15 03:53:16,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 03:53:16,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-15 03:53:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:16,955 INFO L225 Difference]: With dead ends: 110 [2022-02-15 03:53:16,955 INFO L226 Difference]: Without dead ends: 108 [2022-02-15 03:53:16,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-15 03:53:16,956 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:16,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 188 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-15 03:53:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2022-02-15 03:53:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-02-15 03:53:16,968 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2022-02-15 03:53:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:16,968 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-02-15 03:53:16,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-02-15 03:53:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 03:53:16,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:16,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:16,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 03:53:16,969 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:16,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:16,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1696726294, now seen corresponding path program 1 times [2022-02-15 03:53:16,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:16,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [383409788] [2022-02-15 03:53:16,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:16,973 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:17,071 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:17,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [383409788] [2022-02-15 03:53:17,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [383409788] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:17,072 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:17,072 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 03:53:17,072 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293251448] [2022-02-15 03:53:17,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:17,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 03:53:17,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:17,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 03:53:17,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:53:17,073 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:17,248 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-02-15 03:53:17,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 03:53:17,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-15 03:53:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:17,249 INFO L225 Difference]: With dead ends: 108 [2022-02-15 03:53:17,249 INFO L226 Difference]: Without dead ends: 106 [2022-02-15 03:53:17,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-15 03:53:17,250 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:17,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 181 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-15 03:53:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2022-02-15 03:53:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-02-15 03:53:17,259 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 17 [2022-02-15 03:53:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:17,260 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-02-15 03:53:17,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-02-15 03:53:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 03:53:17,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:17,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:17,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 03:53:17,261 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:17,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:17,261 INFO L85 PathProgramCache]: Analyzing trace with hash 160273451, now seen corresponding path program 1 times [2022-02-15 03:53:17,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:17,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [534794985] [2022-02-15 03:53:17,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:17,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:17,263 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:17,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:17,303 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:17,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [534794985] [2022-02-15 03:53:17,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [534794985] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:17,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:17,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 03:53:17,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530613735] [2022-02-15 03:53:17,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:17,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 03:53:17,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 03:53:17,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 03:53:17,305 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:17,431 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-02-15 03:53:17,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 03:53:17,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-15 03:53:17,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:17,432 INFO L225 Difference]: With dead ends: 79 [2022-02-15 03:53:17,432 INFO L226 Difference]: Without dead ends: 77 [2022-02-15 03:53:17,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:17,433 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:17,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 108 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-15 03:53:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-02-15 03:53:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-02-15 03:53:17,441 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2022-02-15 03:53:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:17,441 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-02-15 03:53:17,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-02-15 03:53:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 03:53:17,442 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:17,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:17,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 03:53:17,442 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:17,443 INFO L85 PathProgramCache]: Analyzing trace with hash 158908031, now seen corresponding path program 1 times [2022-02-15 03:53:17,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:17,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704487079] [2022-02-15 03:53:17,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:17,444 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:17,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:17,521 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:17,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704487079] [2022-02-15 03:53:17,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [704487079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:17,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:17,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 03:53:17,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924471918] [2022-02-15 03:53:17,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:17,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 03:53:17,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 03:53:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:53:17,522 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:17,691 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-02-15 03:53:17,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 03:53:17,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-15 03:53:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:17,693 INFO L225 Difference]: With dead ends: 90 [2022-02-15 03:53:17,693 INFO L226 Difference]: Without dead ends: 88 [2022-02-15 03:53:17,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-15 03:53:17,694 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:17,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 134 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-15 03:53:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2022-02-15 03:53:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-02-15 03:53:17,704 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-02-15 03:53:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:17,705 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-02-15 03:53:17,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-02-15 03:53:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-15 03:53:17,705 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:17,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:17,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 03:53:17,706 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 206623281, now seen corresponding path program 1 times [2022-02-15 03:53:17,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:17,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [794747349] [2022-02-15 03:53:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:17,708 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:17,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:17,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-02-15 03:53:17,781 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:17,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [794747349] [2022-02-15 03:53:17,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [794747349] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:17,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:17,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 03:53:17,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684689196] [2022-02-15 03:53:17,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:17,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 03:53:17,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:17,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 03:53:17,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:53:17,782 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:17,917 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-02-15 03:53:17,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 03:53:17,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-15 03:53:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:17,918 INFO L225 Difference]: With dead ends: 74 [2022-02-15 03:53:17,918 INFO L226 Difference]: Without dead ends: 70 [2022-02-15 03:53:17,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-15 03:53:17,919 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:17,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:17,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-15 03:53:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-02-15 03:53:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-02-15 03:53:17,929 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2022-02-15 03:53:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:17,929 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-02-15 03:53:17,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-02-15 03:53:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 03:53:17,929 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:17,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:17,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 03:53:17,930 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:17,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash 673512821, now seen corresponding path program 1 times [2022-02-15 03:53:17,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:17,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [155399575] [2022-02-15 03:53:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:17,932 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:18,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:18,007 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:18,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [155399575] [2022-02-15 03:53:18,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [155399575] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:18,007 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:18,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 03:53:18,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348889746] [2022-02-15 03:53:18,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:18,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 03:53:18,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:18,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 03:53:18,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:53:18,009 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:18,177 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-02-15 03:53:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 03:53:18,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-15 03:53:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:18,179 INFO L225 Difference]: With dead ends: 91 [2022-02-15 03:53:18,179 INFO L226 Difference]: Without dead ends: 89 [2022-02-15 03:53:18,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-15 03:53:18,180 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 51 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:18,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 199 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-15 03:53:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-02-15 03:53:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-02-15 03:53:18,191 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2022-02-15 03:53:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:18,191 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-02-15 03:53:18,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-02-15 03:53:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-15 03:53:18,192 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:18,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:18,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 03:53:18,193 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1908108286, now seen corresponding path program 1 times [2022-02-15 03:53:18,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:18,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1595292775] [2022-02-15 03:53:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:18,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:18,195 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:18,236 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:18,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1595292775] [2022-02-15 03:53:18,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1595292775] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:18,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:18,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 03:53:18,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966279281] [2022-02-15 03:53:18,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:18,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 03:53:18,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:18,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 03:53:18,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 03:53:18,237 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:18,306 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-02-15 03:53:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 03:53:18,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-15 03:53:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:18,307 INFO L225 Difference]: With dead ends: 66 [2022-02-15 03:53:18,307 INFO L226 Difference]: Without dead ends: 64 [2022-02-15 03:53:18,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:53:18,308 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:18,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 03:53:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-15 03:53:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-15 03:53:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-02-15 03:53:18,319 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 20 [2022-02-15 03:53:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:18,319 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-02-15 03:53:18,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-02-15 03:53:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-15 03:53:18,320 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:18,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:18,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 03:53:18,320 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:18,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash 978188398, now seen corresponding path program 1 times [2022-02-15 03:53:18,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:18,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [655813710] [2022-02-15 03:53:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:18,322 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:18,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:18,353 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:18,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [655813710] [2022-02-15 03:53:18,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [655813710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:18,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:18,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 03:53:18,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504271967] [2022-02-15 03:53:18,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:18,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 03:53:18,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:18,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 03:53:18,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 03:53:18,354 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:18,421 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-02-15 03:53:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 03:53:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-15 03:53:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:18,421 INFO L225 Difference]: With dead ends: 64 [2022-02-15 03:53:18,422 INFO L226 Difference]: Without dead ends: 60 [2022-02-15 03:53:18,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:53:18,422 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:18,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 03:53:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-15 03:53:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-15 03:53:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-02-15 03:53:18,432 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2022-02-15 03:53:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:18,432 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-02-15 03:53:18,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-02-15 03:53:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 03:53:18,433 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:18,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:18,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 03:53:18,433 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:18,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash 272309526, now seen corresponding path program 1 times [2022-02-15 03:53:18,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:18,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [970721555] [2022-02-15 03:53:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:18,435 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:18,491 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:18,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [970721555] [2022-02-15 03:53:18,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [970721555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:18,491 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:18,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 03:53:18,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381812570] [2022-02-15 03:53:18,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:18,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 03:53:18,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:18,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 03:53:18,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:53:18,514 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:18,671 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-02-15 03:53:18,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 03:53:18,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-15 03:53:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:18,672 INFO L225 Difference]: With dead ends: 75 [2022-02-15 03:53:18,672 INFO L226 Difference]: Without dead ends: 73 [2022-02-15 03:53:18,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-15 03:53:18,673 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 111 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:18,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 62 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-15 03:53:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2022-02-15 03:53:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-02-15 03:53:18,685 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2022-02-15 03:53:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:18,685 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-02-15 03:53:18,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-02-15 03:53:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 03:53:18,686 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:18,686 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:18,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 03:53:18,687 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:18,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1682587452, now seen corresponding path program 1 times [2022-02-15 03:53:18,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:18,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [472314705] [2022-02-15 03:53:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:18,708 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Could not compute Simultaneous Update! [2022-02-15 03:53:18,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:18,709 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:18,788 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:18,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [472314705] [2022-02-15 03:53:18,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [472314705] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:18,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:18,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 03:53:18,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116786023] [2022-02-15 03:53:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:18,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 03:53:18,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:18,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 03:53:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:18,790 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:18,941 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-02-15 03:53:18,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 03:53:18,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-15 03:53:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:18,942 INFO L225 Difference]: With dead ends: 72 [2022-02-15 03:53:18,942 INFO L226 Difference]: Without dead ends: 70 [2022-02-15 03:53:18,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-15 03:53:18,943 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:18,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 60 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-15 03:53:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2022-02-15 03:53:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-02-15 03:53:18,954 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2022-02-15 03:53:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:18,954 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-02-15 03:53:18,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-02-15 03:53:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-15 03:53:18,955 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:18,955 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:18,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 03:53:18,955 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1683018428, now seen corresponding path program 1 times [2022-02-15 03:53:18,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:18,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1021054318] [2022-02-15 03:53:18,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:18,958 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Could not compute Simultaneous Update! [2022-02-15 03:53:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:18,959 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:19,015 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:19,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1021054318] [2022-02-15 03:53:19,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1021054318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:19,015 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:19,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 03:53:19,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754372588] [2022-02-15 03:53:19,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:19,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 03:53:19,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 03:53:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:19,016 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:19,130 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-02-15 03:53:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 03:53:19,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-15 03:53:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:19,131 INFO L225 Difference]: With dead ends: 67 [2022-02-15 03:53:19,131 INFO L226 Difference]: Without dead ends: 65 [2022-02-15 03:53:19,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-15 03:53:19,132 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 88 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:19,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 48 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-15 03:53:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2022-02-15 03:53:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-02-15 03:53:19,141 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2022-02-15 03:53:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:19,142 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-02-15 03:53:19,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-15 03:53:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 03:53:19,142 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:19,142 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:19,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 03:53:19,143 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1184340980, now seen corresponding path program 1 times [2022-02-15 03:53:19,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:19,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [661831059] [2022-02-15 03:53:19,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:19,145 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:19,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:19,198 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:19,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [661831059] [2022-02-15 03:53:19,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [661831059] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:19,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:19,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 03:53:19,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416978666] [2022-02-15 03:53:19,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:19,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 03:53:19,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:19,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 03:53:19,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:19,199 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:19,317 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-02-15 03:53:19,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 03:53:19,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-15 03:53:19,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:19,319 INFO L225 Difference]: With dead ends: 56 [2022-02-15 03:53:19,319 INFO L226 Difference]: Without dead ends: 54 [2022-02-15 03:53:19,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-15 03:53:19,321 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:19,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 58 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-15 03:53:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-02-15 03:53:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-02-15 03:53:19,329 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-02-15 03:53:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:19,329 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-02-15 03:53:19,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-02-15 03:53:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 03:53:19,330 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:53:19,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:19,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 03:53:19,330 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-02-15 03:53:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:53:19,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1136625730, now seen corresponding path program 1 times [2022-02-15 03:53:19,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:53:19,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1410772238] [2022-02-15 03:53:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:53:19,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:53:19,333 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:53:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:19,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:53:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:53:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:53:19,415 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:53:19,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1410772238] [2022-02-15 03:53:19,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1410772238] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:53:19,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:53:19,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 03:53:19,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315608456] [2022-02-15 03:53:19,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:53:19,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 03:53:19,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:53:19,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 03:53:19,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:53:19,416 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:53:19,512 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-15 03:53:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 03:53:19,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-15 03:53:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:53:19,512 INFO L225 Difference]: With dead ends: 39 [2022-02-15 03:53:19,512 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 03:53:19,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-15 03:53:19,513 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 72 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:53:19,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 43 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:53:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 03:53:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 03:53:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 03:53:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 03:53:19,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-02-15 03:53:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:53:19,514 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 03:53:19,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:53:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 03:53:19,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 03:53:19,517 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-02-15 03:53:19,517 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-02-15 03:53:19,517 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-02-15 03:53:19,517 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-02-15 03:53:19,517 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-02-15 03:53:19,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-02-15 03:53:19,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-02-15 03:53:19,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-02-15 03:53:19,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-02-15 03:53:19,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-02-15 03:53:19,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-02-15 03:53:19,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-02-15 03:53:19,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-02-15 03:53:19,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-02-15 03:53:19,518 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-02-15 03:53:19,519 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-02-15 03:53:19,519 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-02-15 03:53:19,519 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-02-15 03:53:19,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 03:53:19,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-15 03:53:30,483 WARN L228 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 62 DAG size of output: 62 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-15 03:53:47,286 WARN L228 SmtUtils]: Spent 14.11s on a formula simplification. DAG size of input: 76 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-15 03:53:51,100 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-02-15 03:53:51,100 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-02-15 03:53:51,100 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-02-15 03:53:51,101 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-02-15 03:53:51,101 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-15 03:53:51,101 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-02-15 03:53:51,101 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-02-15 03:53:51,101 INFO L854 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) the Hoare annotation is: false [2022-02-15 03:53:51,101 INFO L854 garLoopResultBuilder]: At program point L126(line 126) the Hoare annotation is: false [2022-02-15 03:53:51,101 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 15 402) the Hoare annotation is: true [2022-02-15 03:53:51,101 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: false [2022-02-15 03:53:51,101 INFO L854 garLoopResultBuilder]: At program point L176(line 176) the Hoare annotation is: false [2022-02-15 03:53:51,102 INFO L854 garLoopResultBuilder]: At program point L366(line 366) the Hoare annotation is: false [2022-02-15 03:53:51,102 INFO L854 garLoopResultBuilder]: At program point L333(line 333) the Hoare annotation is: false [2022-02-15 03:53:51,102 INFO L854 garLoopResultBuilder]: At program point L234(lines 234 242) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 0)) .cse2))) [2022-02-15 03:53:51,102 INFO L854 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) the Hoare annotation is: false [2022-02-15 03:53:51,102 INFO L854 garLoopResultBuilder]: At program point L152(lines 152 160) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,102 INFO L854 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) the Hoare annotation is: false [2022-02-15 03:53:51,102 INFO L854 garLoopResultBuilder]: At program point L309(line 309) the Hoare annotation is: false [2022-02-15 03:53:51,102 INFO L854 garLoopResultBuilder]: At program point L20(lines 20 401) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-02-15 03:53:51,102 INFO L854 garLoopResultBuilder]: At program point L276(lines 276 391) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,102 INFO L854 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) the Hoare annotation is: false [2022-02-15 03:53:51,103 INFO L854 garLoopResultBuilder]: At program point L70(lines 70 94) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,103 INFO L854 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (and (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 (<= 1 main_~main__t~0)) (and .cse3 .cse1))))) (or (and .cse2 (not (= main_~__VERIFIER_assert__cond~18 0))) (and .cse2 .cse1))))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~19 0))) (and .cse0 .cse1)))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-02-15 03:53:51,103 INFO L854 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) (and (= main_~main__t~0 0) (< 0 main_~main__tagbuf_len~0))) [2022-02-15 03:53:51,103 INFO L854 garLoopResultBuilder]: At program point L186(lines 186 196) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-15 03:53:51,103 INFO L854 garLoopResultBuilder]: At program point L376(lines 376 385) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~18 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~19 0))) [2022-02-15 03:53:51,103 INFO L854 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) the Hoare annotation is: false [2022-02-15 03:53:51,103 INFO L854 garLoopResultBuilder]: At program point L343(lines 343 352) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~17 0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-15 03:53:51,103 INFO L854 garLoopResultBuilder]: At program point L112(lines 112 203) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-15 03:53:51,103 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 15 402) the Hoare annotation is: true [2022-02-15 03:53:51,103 INFO L854 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: false [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) the Hoare annotation is: false [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) the Hoare annotation is: false [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 15 402) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point L154(line 154) the Hoare annotation is: false [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point L278(line 278) the Hoare annotation is: false [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) the Hoare annotation is: false [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point L105(lines 105 209) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: false [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point L39(lines 39 255) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,104 INFO L854 garLoopResultBuilder]: At program point L295(lines 295 317) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,105 INFO L854 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) the Hoare annotation is: false [2022-02-15 03:53:51,105 INFO L854 garLoopResultBuilder]: At program point L188(line 188) the Hoare annotation is: false [2022-02-15 03:53:51,105 INFO L854 garLoopResultBuilder]: At program point L378(line 378) the Hoare annotation is: false [2022-02-15 03:53:51,105 INFO L854 garLoopResultBuilder]: At program point L345(line 345) the Hoare annotation is: false [2022-02-15 03:53:51,105 INFO L854 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) the Hoare annotation is: false [2022-02-15 03:53:51,105 INFO L854 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: false [2022-02-15 03:53:51,105 INFO L854 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) the Hoare annotation is: false [2022-02-15 03:53:51,105 INFO L854 garLoopResultBuilder]: At program point L32(lines 32 395) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,105 INFO L854 garLoopResultBuilder]: At program point L288(lines 288 390) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,105 INFO L854 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) the Hoare annotation is: false [2022-02-15 03:53:51,106 INFO L854 garLoopResultBuilder]: At program point L222(lines 222 244) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 (not (<= main_~main__tagbuf_len~0 0)) .cse1) (and .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1))) [2022-02-15 03:53:51,106 INFO L854 garLoopResultBuilder]: At program point L24(lines 24 396) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,106 INFO L854 garLoopResultBuilder]: At program point L82(lines 82 92) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,106 INFO L854 garLoopResultBuilder]: At program point L140(lines 140 162) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,106 INFO L854 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) the Hoare annotation is: false [2022-02-15 03:53:51,106 INFO L854 garLoopResultBuilder]: At program point L297(line 297) the Hoare annotation is: false [2022-02-15 03:53:51,106 INFO L854 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) the Hoare annotation is: false [2022-02-15 03:53:51,106 INFO L854 garLoopResultBuilder]: At program point L124(lines 124 201) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-15 03:53:51,106 INFO L861 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2022-02-15 03:53:51,106 INFO L854 garLoopResultBuilder]: At program point L215(lines 215 250) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-15 03:53:51,106 INFO L854 garLoopResultBuilder]: At program point L50(lines 50 253) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,107 INFO L854 garLoopResultBuilder]: At program point L174(lines 174 198) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-15 03:53:51,107 INFO L854 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) the Hoare annotation is: false [2022-02-15 03:53:51,107 INFO L854 garLoopResultBuilder]: At program point L364(lines 364 387) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~18 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-02-15 03:53:51,107 INFO L854 garLoopResultBuilder]: At program point L331(lines 331 354) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0)))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-15 03:53:51,107 INFO L854 garLoopResultBuilder]: At program point L265(lines 265 393) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= main_~main__t~0 0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (< 0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,107 INFO L854 garLoopResultBuilder]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) the Hoare annotation is: false [2022-02-15 03:53:51,107 INFO L854 garLoopResultBuilder]: At program point L133(lines 133 200) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-02-15 03:53:51,107 INFO L854 garLoopResultBuilder]: At program point L224(line 224) the Hoare annotation is: false [2022-02-15 03:53:51,107 INFO L854 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) the Hoare annotation is: false [2022-02-15 03:53:51,108 INFO L854 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-15 03:53:51,108 INFO L854 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: false [2022-02-15 03:53:51,108 INFO L854 garLoopResultBuilder]: At program point L307(lines 307 315) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-02-15 03:53:51,108 INFO L854 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) the Hoare annotation is: false [2022-02-15 03:53:51,108 INFO L854 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: false [2022-02-15 03:53:51,108 INFO L854 garLoopResultBuilder]: At program point L101(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-02-15 03:53:51,108 INFO L854 garLoopResultBuilder]: At program point L324(lines 324 389) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~19 0)))))) [2022-02-15 03:53:51,108 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-15 03:53:51,108 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-15 03:53:51,108 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-15 03:53:51,108 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-15 03:53:51,109 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-15 03:53:51,109 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-15 03:53:51,109 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-15 03:53:51,112 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:53:51,113 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 03:53:51,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 03:53:51 BoogieIcfgContainer [2022-02-15 03:53:51,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 03:53:51,143 INFO L158 Benchmark]: Toolchain (without parser) took 38055.05ms. Allocated memory was 179.3MB in the beginning and 488.6MB in the end (delta: 309.3MB). Free memory was 124.6MB in the beginning and 202.7MB in the end (delta: -78.1MB). Peak memory consumption was 273.9MB. Max. memory is 8.0GB. [2022-02-15 03:53:51,143 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 03:53:51,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.55ms. Allocated memory was 179.3MB in the beginning and 228.6MB in the end (delta: 49.3MB). Free memory was 124.4MB in the beginning and 195.2MB in the end (delta: -70.8MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-02-15 03:53:51,144 INFO L158 Benchmark]: Boogie Preprocessor took 26.37ms. Allocated memory is still 228.6MB. Free memory was 195.2MB in the beginning and 193.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 03:53:51,144 INFO L158 Benchmark]: RCFGBuilder took 420.41ms. Allocated memory is still 228.6MB. Free memory was 193.1MB in the beginning and 177.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-02-15 03:53:51,144 INFO L158 Benchmark]: TraceAbstraction took 37293.93ms. Allocated memory was 228.6MB in the beginning and 488.6MB in the end (delta: 260.0MB). Free memory was 177.9MB in the beginning and 202.7MB in the end (delta: -24.8MB). Peak memory consumption was 278.8MB. Max. memory is 8.0GB. [2022-02-15 03:53:51,145 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 179.3MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.55ms. Allocated memory was 179.3MB in the beginning and 228.6MB in the end (delta: 49.3MB). Free memory was 124.4MB in the beginning and 195.2MB in the end (delta: -70.8MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.37ms. Allocated memory is still 228.6MB. Free memory was 195.2MB in the beginning and 193.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 420.41ms. Allocated memory is still 228.6MB. Free memory was 193.1MB in the beginning and 177.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 37293.93ms. Allocated memory was 228.6MB in the beginning and 488.6MB in the end (delta: 260.0MB). Free memory was 177.9MB in the beginning and 202.7MB in the end (delta: -24.8MB). Peak memory consumption was 278.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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 37.2s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 31.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1442 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1442 mSDsluCounter, 2848 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1755 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3304 IncrementalHoareTripleChecker+Invalid, 3464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 1093 mSDtfsCounter, 3304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 432 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 80 LocationsWithAnnotation, 80 PreInvPairs, 97 NumberOfFragments, 799 HoareAnnotationTreeSize, 80 FomulaSimplifications, 1699038 FormulaSimplificationTreeSizeReduction, 30.2s HoareSimplificationTime, 80 FomulaSimplificationsInter, 2584793 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && (((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) && 1 <= main__t) || (main__t == 0 && 0 < main__tagbuf_len) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && main__t == 0)) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-02-15 03:53:51,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...