java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:46:15,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:46:15,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:46:15,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:46:15,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:46:15,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:46:15,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:46:15,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:46:15,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:46:15,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:46:15,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:46:15,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:46:15,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:46:15,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:46:15,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:46:15,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:46:15,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:46:15,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:46:15,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:46:15,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:46:15,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:46:15,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:46:15,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:46:15,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:46:15,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:46:15,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:46:15,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:46:15,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:46:15,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:46:15,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:46:15,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:46:15,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:46:15,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:46:15,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:46:15,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:46:15,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:46:15,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:46:15,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:46:15,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:46:15,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:46:15,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:46:15,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 12:46:15,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:46:15,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:46:15,279 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 12:46:15,279 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 12:46:15,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 12:46:15,280 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 12:46:15,280 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 12:46:15,281 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 12:46:15,281 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 12:46:15,281 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 12:46:15,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:46:15,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:46:15,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:46:15,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:46:15,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:46:15,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:46:15,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:46:15,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:46:15,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:46:15,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:46:15,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:46:15,284 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 12:46:15,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:46:15,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:46:15,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:46:15,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:46:15,285 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 12:46:15,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:46:15,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:46:15,285 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 12:46:15,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:46:15,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:46:15,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:46:15,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:46:15,344 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:46:15,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-09-05 12:46:15,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97896754/6a94f362a01d498c81fd16c4a6fe3897/FLAG5fdafd7a9 [2019-09-05 12:46:15,871 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:46:15,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-09-05 12:46:15,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97896754/6a94f362a01d498c81fd16c4a6fe3897/FLAG5fdafd7a9 [2019-09-05 12:46:16,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d97896754/6a94f362a01d498c81fd16c4a6fe3897 [2019-09-05 12:46:16,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:46:16,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:46:16,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:46:16,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:46:16,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:46:16,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:46:16" (1/1) ... [2019-09-05 12:46:16,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75411fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16, skipping insertion in model container [2019-09-05 12:46:16,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:46:16" (1/1) ... [2019-09-05 12:46:16,276 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:46:16,296 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:46:16,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:46:16,541 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:46:16,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:46:16,690 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:46:16,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16 WrapperNode [2019-09-05 12:46:16,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:46:16,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:46:16,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:46:16,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:46:16,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16" (1/1) ... [2019-09-05 12:46:16,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16" (1/1) ... [2019-09-05 12:46:16,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16" (1/1) ... [2019-09-05 12:46:16,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16" (1/1) ... [2019-09-05 12:46:16,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16" (1/1) ... [2019-09-05 12:46:16,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16" (1/1) ... [2019-09-05 12:46:16,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16" (1/1) ... [2019-09-05 12:46:16,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:46:16,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:46:16,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:46:16,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:46:16,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:46:16,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:46:16,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:46:16,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:46:16,796 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2019-09-05 12:46:16,797 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2019-09-05 12:46:16,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:46:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:46:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:46:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-09-05 12:46:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-09-05 12:46:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-09-05 12:46:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-09-05 12:46:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2019-09-05 12:46:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-09-05 12:46:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-09-05 12:46:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-09-05 12:46:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-09-05 12:46:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-09-05 12:46:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-05 12:46:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2019-09-05 12:46:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2019-09-05 12:46:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2019-09-05 12:46:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2019-09-05 12:46:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2019-09-05 12:46:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2019-09-05 12:46:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2019-09-05 12:46:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2019-09-05 12:46:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2019-09-05 12:46:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2019-09-05 12:46:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2019-09-05 12:46:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2019-09-05 12:46:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2019-09-05 12:46:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2019-09-05 12:46:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2019-09-05 12:46:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 12:46:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 12:46:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 12:46:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 12:46:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:46:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:46:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:46:17,227 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:46:17,228 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-05 12:46:17,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:46:17 BoogieIcfgContainer [2019-09-05 12:46:17,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:46:17,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:46:17,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:46:17,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:46:17,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:46:16" (1/3) ... [2019-09-05 12:46:17,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5eb326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:46:17, skipping insertion in model container [2019-09-05 12:46:17,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:16" (2/3) ... [2019-09-05 12:46:17,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5eb326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:46:17, skipping insertion in model container [2019-09-05 12:46:17,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:46:17" (3/3) ... [2019-09-05 12:46:17,239 INFO L109 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2019-09-05 12:46:17,248 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:46:17,258 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:46:17,276 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:46:17,312 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:46:17,312 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 12:46:17,312 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:46:17,312 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:46:17,313 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:46:17,313 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:46:17,313 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:46:17,313 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:46:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-09-05 12:46:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 12:46:17,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:17,349 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:17,353 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:17,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2018987797, now seen corresponding path program 1 times [2019-09-05 12:46:17,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:17,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:17,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:17,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:17,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:17,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:46:17,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:17,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:46:17,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:46:17,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:46:17,560 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2019-09-05 12:46:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:17,578 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2019-09-05 12:46:17,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:46:17,580 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2019-09-05 12:46:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:17,587 INFO L225 Difference]: With dead ends: 51 [2019-09-05 12:46:17,588 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 12:46:17,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:46:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 12:46:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 12:46:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 12:46:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-09-05 12:46:17,624 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2019-09-05 12:46:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:17,625 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-09-05 12:46:17,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:46:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-09-05 12:46:17,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 12:46:17,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:17,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:17,627 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:17,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:17,627 INFO L82 PathProgramCache]: Analyzing trace with hash -171780126, now seen corresponding path program 1 times [2019-09-05 12:46:17,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:17,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:17,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:17,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:17,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:17,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:17,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:17,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:17,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:17,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:17,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:17,699 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 3 states. [2019-09-05 12:46:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:17,741 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-09-05 12:46:17,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:17,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-05 12:46:17,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:17,745 INFO L225 Difference]: With dead ends: 44 [2019-09-05 12:46:17,746 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 12:46:17,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:17,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 12:46:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-05 12:46:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:46:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-09-05 12:46:17,761 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2019-09-05 12:46:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:17,762 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-09-05 12:46:17,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-09-05 12:46:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 12:46:17,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:17,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:17,767 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:17,768 INFO L82 PathProgramCache]: Analyzing trace with hash 250921700, now seen corresponding path program 1 times [2019-09-05 12:46:17,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:17,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:17,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:17,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:17,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:17,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:46:17,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:17,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:46:17,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:46:17,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:46:17,862 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 5 states. [2019-09-05 12:46:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:17,968 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2019-09-05 12:46:17,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:46:17,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-09-05 12:46:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:17,972 INFO L225 Difference]: With dead ends: 71 [2019-09-05 12:46:17,972 INFO L226 Difference]: Without dead ends: 71 [2019-09-05 12:46:17,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:46:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-05 12:46:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2019-09-05 12:46:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 12:46:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-09-05 12:46:17,985 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 33 [2019-09-05 12:46:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:17,986 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-09-05 12:46:17,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:46:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-09-05 12:46:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 12:46:17,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:17,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:17,988 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1210151716, now seen corresponding path program 1 times [2019-09-05 12:46:17,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:17,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:17,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:17,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:17,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:18,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:18,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-05 12:46:18,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:18,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 12:46:18,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 12:46:18,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:46:18,142 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 8 states. [2019-09-05 12:46:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:18,414 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2019-09-05 12:46:18,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:46:18,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-05 12:46:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:18,416 INFO L225 Difference]: With dead ends: 115 [2019-09-05 12:46:18,417 INFO L226 Difference]: Without dead ends: 90 [2019-09-05 12:46:18,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:46:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-05 12:46:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2019-09-05 12:46:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 12:46:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-09-05 12:46:18,433 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 33 [2019-09-05 12:46:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:18,434 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-09-05 12:46:18,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 12:46:18,434 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-09-05 12:46:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 12:46:18,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:18,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:18,436 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:18,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash -783992990, now seen corresponding path program 1 times [2019-09-05 12:46:18,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:18,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:18,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:18,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:18,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 12:46:18,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:18,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:46:18,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:46:18,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:46:18,543 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 7 states. [2019-09-05 12:46:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:18,679 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2019-09-05 12:46:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:46:18,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-09-05 12:46:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:18,682 INFO L225 Difference]: With dead ends: 93 [2019-09-05 12:46:18,682 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 12:46:18,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:46:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 12:46:18,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2019-09-05 12:46:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-05 12:46:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-09-05 12:46:18,689 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 33 [2019-09-05 12:46:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:18,690 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-09-05 12:46:18,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:46:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-09-05 12:46:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 12:46:18,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:18,691 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:18,692 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:18,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:18,692 INFO L82 PathProgramCache]: Analyzing trace with hash -731835505, now seen corresponding path program 1 times [2019-09-05 12:46:18,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:18,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:18,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:18,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:18,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 12:46:18,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:18,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-05 12:46:18,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:18,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:46:18,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:46:18,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:46:18,809 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 9 states. [2019-09-05 12:46:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:19,044 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2019-09-05 12:46:19,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:46:19,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-09-05 12:46:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:19,046 INFO L225 Difference]: With dead ends: 119 [2019-09-05 12:46:19,046 INFO L226 Difference]: Without dead ends: 110 [2019-09-05 12:46:19,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:46:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-05 12:46:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2019-09-05 12:46:19,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 12:46:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2019-09-05 12:46:19,067 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 38 [2019-09-05 12:46:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:19,068 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2019-09-05 12:46:19,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:46:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2019-09-05 12:46:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 12:46:19,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:19,072 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:19,072 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:19,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1568987085, now seen corresponding path program 1 times [2019-09-05 12:46:19,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:19,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:19,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:19,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:19,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 12:46:19,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:19,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 12:46:19,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:19,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:46:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:46:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:46:19,209 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand 7 states. [2019-09-05 12:46:19,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:19,337 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2019-09-05 12:46:19,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:46:19,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-09-05 12:46:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:19,339 INFO L225 Difference]: With dead ends: 111 [2019-09-05 12:46:19,339 INFO L226 Difference]: Without dead ends: 111 [2019-09-05 12:46:19,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:46:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-05 12:46:19,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2019-09-05 12:46:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-05 12:46:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2019-09-05 12:46:19,349 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 38 [2019-09-05 12:46:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:19,350 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2019-09-05 12:46:19,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:46:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2019-09-05 12:46:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 12:46:19,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:19,354 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:19,354 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:19,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1909797290, now seen corresponding path program 1 times [2019-09-05 12:46:19,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:19,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:19,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:19,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:19,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 12:46:19,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:19,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 12:46:19,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:19,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 12:46:19,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 12:46:19,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 12:46:19,425 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand 4 states. [2019-09-05 12:46:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:19,451 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2019-09-05 12:46:19,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:19,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-09-05 12:46:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:19,454 INFO L225 Difference]: With dead ends: 108 [2019-09-05 12:46:19,454 INFO L226 Difference]: Without dead ends: 108 [2019-09-05 12:46:19,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:46:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-05 12:46:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-09-05 12:46:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-05 12:46:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 136 transitions. [2019-09-05 12:46:19,482 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 136 transitions. Word has length 40 [2019-09-05 12:46:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:19,482 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 136 transitions. [2019-09-05 12:46:19,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 12:46:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 136 transitions. [2019-09-05 12:46:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 12:46:19,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:19,484 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:19,484 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:19,484 INFO L82 PathProgramCache]: Analyzing trace with hash 888728936, now seen corresponding path program 1 times [2019-09-05 12:46:19,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:19,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:19,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:19,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:19,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:19,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:19,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:19,565 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2019-09-05 12:46:19,567 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [22], [27], [31], [37], [40], [44], [49], [52], [57], [59], [65], [71], [74], [80], [86], [88], [95], [97], [99], [104], [110], [111], [115], [118], [120], [126], [128], [129], [130], [132], [133], [134] [2019-09-05 12:46:19,607 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:46:19,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:46:19,670 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-05 12:46:19,671 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 14 variables. [2019-09-05 12:46:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:19,676 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-05 12:46:19,712 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-05 12:46:19,712 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-05 12:46:19,715 INFO L420 sIntCurrentIteration]: We unified 39 AI predicates to 39 [2019-09-05 12:46:19,715 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-05 12:46:19,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:46:19,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-05 12:46:19,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:19,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:46:19,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:46:19,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:46:19,717 INFO L87 Difference]: Start difference. First operand 108 states and 136 transitions. Second operand 2 states. [2019-09-05 12:46:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:19,718 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-05 12:46:19,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:46:19,718 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2019-09-05 12:46:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:19,718 INFO L225 Difference]: With dead ends: 6 [2019-09-05 12:46:19,719 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 12:46:19,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:46:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 12:46:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 12:46:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 12:46:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 12:46:19,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2019-09-05 12:46:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:19,720 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 12:46:19,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:46:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 12:46:19,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 12:46:19,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:46:19 BoogieIcfgContainer [2019-09-05 12:46:19,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 12:46:19,728 INFO L168 Benchmark]: Toolchain (without parser) took 3466.07 ms. Allocated memory was 133.2 MB in the beginning and 258.5 MB in the end (delta: 125.3 MB). Free memory was 88.8 MB in the beginning and 208.0 MB in the end (delta: -119.2 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2019-09-05 12:46:19,729 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-09-05 12:46:19,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.22 ms. Allocated memory was 133.2 MB in the beginning and 198.7 MB in the end (delta: 65.5 MB). Free memory was 88.5 MB in the beginning and 173.4 MB in the end (delta: -84.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-09-05 12:46:19,731 INFO L168 Benchmark]: Boogie Preprocessor took 43.36 ms. Allocated memory is still 198.7 MB. Free memory was 173.4 MB in the beginning and 171.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-05 12:46:19,731 INFO L168 Benchmark]: RCFGBuilder took 494.57 ms. Allocated memory is still 198.7 MB. Free memory was 170.9 MB in the beginning and 144.7 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-09-05 12:46:19,732 INFO L168 Benchmark]: TraceAbstraction took 2495.02 ms. Allocated memory was 198.7 MB in the beginning and 258.5 MB in the end (delta: 59.8 MB). Free memory was 144.1 MB in the beginning and 208.0 MB in the end (delta: -63.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-05 12:46:19,736 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 429.22 ms. Allocated memory was 133.2 MB in the beginning and 198.7 MB in the end (delta: 65.5 MB). Free memory was 88.5 MB in the beginning and 173.4 MB in the end (delta: -84.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.36 ms. Allocated memory is still 198.7 MB. Free memory was 173.4 MB in the beginning and 171.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 494.57 ms. Allocated memory is still 198.7 MB. Free memory was 170.9 MB in the beginning and 144.7 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2495.02 ms. Allocated memory was 198.7 MB in the beginning and 258.5 MB in the end (delta: 59.8 MB). Free memory was 144.1 MB in the beginning and 208.0 MB in the end (delta: -63.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 428 SDtfs, 316 SDslu, 1099 SDs, 0 SdLazy, 572 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9871794871794872 AbsIntWeakeningRatio, 1.5897435897435896 AbsIntAvgWeakeningVarsNumRemoved, 0.15384615384615385 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 113 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 308 ConstructedInterpolants, 0 QuantifiedInterpolants, 26853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 6/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...