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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/forester-heap/sll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 00:11:05,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:11:05,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:11:05,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:11:05,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:11:05,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:11:05,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:11:05,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:11:05,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:11:05,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:11:05,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:11:05,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:11:05,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:11:05,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:11:05,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:11:05,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:11:05,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:11:05,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:11:06,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:11:06,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:11:06,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:11:06,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:11:06,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:11:06,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:11:06,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:11:06,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:11:06,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:11:06,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:11:06,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:11:06,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:11:06,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:11:06,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:11:06,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:11:06,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:11:06,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:11:06,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:11:06,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:11:06,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:11:06,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:11:06,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:11:06,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:11:06,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 00:11:06,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:11:06,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:11:06,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:11:06,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:11:06,061 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:11:06,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:11:06,061 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:11:06,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:11:06,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:11:06,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:11:06,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:11:06,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:11:06,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:11:06,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:11:06,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:11:06,064 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:11:06,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:11:06,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:11:06,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:11:06,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:11:06,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:11:06,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:11:06,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:11:06,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:11:06,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:11:06,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:11:06,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:11:06,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:11:06,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 00:11:06,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:11:06,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:11:06,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:11:06,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:11:06,365 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:11:06,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-10-15 00:11:06,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155cb2986/28d84da6501648958885573f73801f94/FLAGb5777bdb7 [2019-10-15 00:11:06,976 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:11:06,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i [2019-10-15 00:11:06,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155cb2986/28d84da6501648958885573f73801f94/FLAGb5777bdb7 [2019-10-15 00:11:07,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155cb2986/28d84da6501648958885573f73801f94 [2019-10-15 00:11:07,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:11:07,351 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:11:07,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:07,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:11:07,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:11:07,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:07" (1/1) ... [2019-10-15 00:11:07,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79462fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07, skipping insertion in model container [2019-10-15 00:11:07,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:11:07" (1/1) ... [2019-10-15 00:11:07,367 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:11:07,421 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:11:07,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:07,867 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:11:07,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:11:07,971 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:11:07,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07 WrapperNode [2019-10-15 00:11:07,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:11:07,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:11:07,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:11:07,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:11:07,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2019-10-15 00:11:07,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2019-10-15 00:11:08,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2019-10-15 00:11:08,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2019-10-15 00:11:08,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2019-10-15 00:11:08,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2019-10-15 00:11:08,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (1/1) ... [2019-10-15 00:11:08,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:11:08,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:11:08,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:11:08,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:11:08,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (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-10-15 00:11:08,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:11:08,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:11:08,100 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:11:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 00:11:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 00:11:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 00:11:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 00:11:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 00:11:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 00:11:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 00:11:08,101 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 00:11:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 00:11:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 00:11:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 00:11:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 00:11:08,102 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 00:11:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 00:11:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 00:11:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 00:11:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 00:11:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 00:11:08,103 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 00:11:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 00:11:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 00:11:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 00:11:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 00:11:08,104 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 00:11:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 00:11:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 00:11:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 00:11:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 00:11:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 00:11:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 00:11:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 00:11:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 00:11:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 00:11:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 00:11:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 00:11:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 00:11:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 00:11:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 00:11:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 00:11:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 00:11:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 00:11:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 00:11:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 00:11:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 00:11:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 00:11:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 00:11:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 00:11:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 00:11:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 00:11:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 00:11:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 00:11:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 00:11:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 00:11:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 00:11:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 00:11:08,109 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 00:11:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 00:11:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 00:11:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 00:11:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 00:11:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 00:11:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 00:11:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 00:11:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:11:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 00:11:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 00:11:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 00:11:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 00:11:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 00:11:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 00:11:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 00:11:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 00:11:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 00:11:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 00:11:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 00:11:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 00:11:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 00:11:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 00:11:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 00:11:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 00:11:08,113 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 00:11:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 00:11:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 00:11:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 00:11:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 00:11:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 00:11:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 00:11:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 00:11:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 00:11:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 00:11:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 00:11:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 00:11:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 00:11:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 00:11:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 00:11:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 00:11:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 00:11:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 00:11:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 00:11:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 00:11:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 00:11:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 00:11:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 00:11:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:11:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:11:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:11:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 00:11:08,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 00:11:08,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 00:11:08,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 00:11:08,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:11:08,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:11:08,787 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:11:08,787 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-15 00:11:08,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:08 BoogieIcfgContainer [2019-10-15 00:11:08,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:11:08,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:11:08,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:11:08,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:11:08,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:11:07" (1/3) ... [2019-10-15 00:11:08,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ac760d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:08, skipping insertion in model container [2019-10-15 00:11:08,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:11:07" (2/3) ... [2019-10-15 00:11:08,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ac760d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:11:08, skipping insertion in model container [2019-10-15 00:11:08,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:11:08" (3/3) ... [2019-10-15 00:11:08,800 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2019-10-15 00:11:08,810 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:11:08,819 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-15 00:11:08,831 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-15 00:11:08,870 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:11:08,871 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:11:08,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:11:08,871 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:11:08,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:11:08,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:11:08,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:11:08,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:11:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-10-15 00:11:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-15 00:11:08,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:08,906 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:08,909 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:08,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:08,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2019-10-15 00:11:08,924 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:08,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110591114] [2019-10-15 00:11:08,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:08,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:08,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:09,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110591114] [2019-10-15 00:11:09,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:09,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:11:09,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361476682] [2019-10-15 00:11:09,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:11:09,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:09,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:11:09,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:11:09,130 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-10-15 00:11:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:09,202 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2019-10-15 00:11:09,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:11:09,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-15 00:11:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:09,215 INFO L225 Difference]: With dead ends: 186 [2019-10-15 00:11:09,215 INFO L226 Difference]: Without dead ends: 99 [2019-10-15 00:11:09,219 INFO L600 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-10-15 00:11:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-15 00:11:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2019-10-15 00:11:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-15 00:11:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-10-15 00:11:09,286 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2019-10-15 00:11:09,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:09,286 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-10-15 00:11:09,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:11:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-10-15 00:11:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 00:11:09,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:09,287 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:09,288 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:09,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:09,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2019-10-15 00:11:09,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:09,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724400609] [2019-10-15 00:11:09,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:09,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724400609] [2019-10-15 00:11:09,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:09,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:11:09,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917623695] [2019-10-15 00:11:09,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:11:09,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:09,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:11:09,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:11:09,355 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 3 states. [2019-10-15 00:11:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:09,372 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-10-15 00:11:09,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:11:09,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-15 00:11:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:09,374 INFO L225 Difference]: With dead ends: 84 [2019-10-15 00:11:09,374 INFO L226 Difference]: Without dead ends: 82 [2019-10-15 00:11:09,375 INFO L600 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-10-15 00:11:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-15 00:11:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-10-15 00:11:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-15 00:11:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-10-15 00:11:09,386 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2019-10-15 00:11:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:09,387 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-10-15 00:11:09,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:11:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-10-15 00:11:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 00:11:09,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:09,388 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:09,388 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:09,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2019-10-15 00:11:09,389 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:09,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398540748] [2019-10-15 00:11:09,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:09,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398540748] [2019-10-15 00:11:09,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:09,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:09,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660719938] [2019-10-15 00:11:09,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:09,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:09,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:09,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:09,462 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 4 states. [2019-10-15 00:11:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:09,551 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-15 00:11:09,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:09,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 00:11:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:09,553 INFO L225 Difference]: With dead ends: 83 [2019-10-15 00:11:09,553 INFO L226 Difference]: Without dead ends: 81 [2019-10-15 00:11:09,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-15 00:11:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-10-15 00:11:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-15 00:11:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-10-15 00:11:09,575 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2019-10-15 00:11:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:09,578 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-10-15 00:11:09,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-10-15 00:11:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 00:11:09,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:09,579 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:09,580 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2019-10-15 00:11:09,584 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:09,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300425767] [2019-10-15 00:11:09,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:09,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300425767] [2019-10-15 00:11:09,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:09,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:11:09,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633305843] [2019-10-15 00:11:09,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:11:09,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:09,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:11:09,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:11:09,687 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 3 states. [2019-10-15 00:11:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:09,756 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-10-15 00:11:09,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:11:09,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 00:11:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:09,757 INFO L225 Difference]: With dead ends: 82 [2019-10-15 00:11:09,758 INFO L226 Difference]: Without dead ends: 78 [2019-10-15 00:11:09,758 INFO L600 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-10-15 00:11:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-15 00:11:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-10-15 00:11:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-15 00:11:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2019-10-15 00:11:09,766 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 19 [2019-10-15 00:11:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:09,766 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2019-10-15 00:11:09,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:11:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2019-10-15 00:11:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 00:11:09,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:09,767 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:11:09,768 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1214805939, now seen corresponding path program 1 times [2019-10-15 00:11:09,768 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:09,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180841342] [2019-10-15 00:11:09,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:09,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180841342] [2019-10-15 00:11:09,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:09,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:11:09,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949310377] [2019-10-15 00:11:09,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:11:09,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:09,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:11:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:11:09,830 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 5 states. [2019-10-15 00:11:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:09,941 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2019-10-15 00:11:09,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:09,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-15 00:11:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:09,943 INFO L225 Difference]: With dead ends: 134 [2019-10-15 00:11:09,944 INFO L226 Difference]: Without dead ends: 114 [2019-10-15 00:11:09,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 00:11:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-15 00:11:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 74. [2019-10-15 00:11:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-15 00:11:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2019-10-15 00:11:09,957 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 20 [2019-10-15 00:11:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:09,963 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2019-10-15 00:11:09,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:11:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2019-10-15 00:11:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 00:11:09,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:09,964 INFO L380 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] [2019-10-15 00:11:09,965 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1924122782, now seen corresponding path program 1 times [2019-10-15 00:11:09,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:09,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502083231] [2019-10-15 00:11:09,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:09,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:10,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502083231] [2019-10-15 00:11:10,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:10,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:11:10,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589454420] [2019-10-15 00:11:10,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:11:10,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:10,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:11:10,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:11:10,042 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 3 states. [2019-10-15 00:11:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:10,056 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2019-10-15 00:11:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:11:10,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 00:11:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:10,059 INFO L225 Difference]: With dead ends: 139 [2019-10-15 00:11:10,059 INFO L226 Difference]: Without dead ends: 98 [2019-10-15 00:11:10,059 INFO L600 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-10-15 00:11:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-15 00:11:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2019-10-15 00:11:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-15 00:11:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-10-15 00:11:10,078 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 24 [2019-10-15 00:11:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:10,078 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-10-15 00:11:10,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:11:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-10-15 00:11:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 00:11:10,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:10,082 INFO L380 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] [2019-10-15 00:11:10,083 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:10,083 INFO L82 PathProgramCache]: Analyzing trace with hash -481740404, now seen corresponding path program 1 times [2019-10-15 00:11:10,083 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:10,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404826920] [2019-10-15 00:11:10,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:10,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:10,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:10,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404826920] [2019-10-15 00:11:10,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:10,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:11:10,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085573786] [2019-10-15 00:11:10,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:11:10,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:10,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:11:10,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:11:10,150 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 3 states. [2019-10-15 00:11:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:10,165 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2019-10-15 00:11:10,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:11:10,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 00:11:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:10,167 INFO L225 Difference]: With dead ends: 77 [2019-10-15 00:11:10,167 INFO L226 Difference]: Without dead ends: 75 [2019-10-15 00:11:10,167 INFO L600 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-10-15 00:11:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-15 00:11:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-15 00:11:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-15 00:11:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-10-15 00:11:10,174 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 25 [2019-10-15 00:11:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:10,174 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-10-15 00:11:10,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:11:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-10-15 00:11:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 00:11:10,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:10,175 INFO L380 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] [2019-10-15 00:11:10,176 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:10,176 INFO L82 PathProgramCache]: Analyzing trace with hash -611625627, now seen corresponding path program 1 times [2019-10-15 00:11:10,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:10,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136851635] [2019-10-15 00:11:10,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:10,177 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:10,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:10,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136851635] [2019-10-15 00:11:10,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:10,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:10,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969154110] [2019-10-15 00:11:10,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:10,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:10,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:10,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:10,226 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 4 states. [2019-10-15 00:11:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:10,287 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-10-15 00:11:10,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:10,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-15 00:11:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:10,288 INFO L225 Difference]: With dead ends: 76 [2019-10-15 00:11:10,288 INFO L226 Difference]: Without dead ends: 74 [2019-10-15 00:11:10,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-15 00:11:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-15 00:11:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-15 00:11:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-10-15 00:11:10,294 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 27 [2019-10-15 00:11:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:10,295 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-10-15 00:11:10,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-10-15 00:11:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 00:11:10,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:10,296 INFO L380 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] [2019-10-15 00:11:10,297 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:10,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2038545261, now seen corresponding path program 1 times [2019-10-15 00:11:10,297 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:10,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571969299] [2019-10-15 00:11:10,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:10,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:10,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:10,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571969299] [2019-10-15 00:11:10,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:10,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:11:10,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317709363] [2019-10-15 00:11:10,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:11:10,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:10,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:11:10,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:11:10,340 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 4 states. [2019-10-15 00:11:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:10,429 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2019-10-15 00:11:10,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:11:10,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-10-15 00:11:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:10,431 INFO L225 Difference]: With dead ends: 187 [2019-10-15 00:11:10,431 INFO L226 Difference]: Without dead ends: 126 [2019-10-15 00:11:10,432 INFO L600 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-10-15 00:11:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-15 00:11:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 75. [2019-10-15 00:11:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-15 00:11:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-10-15 00:11:10,438 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 28 [2019-10-15 00:11:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:10,438 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-10-15 00:11:10,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:11:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-10-15 00:11:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 00:11:10,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:10,439 INFO L380 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] [2019-10-15 00:11:10,440 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2019-10-15 00:11:10,441 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:10,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063354081] [2019-10-15 00:11:10,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:10,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:10,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:10,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063354081] [2019-10-15 00:11:10,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:10,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:11:10,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230343446] [2019-10-15 00:11:10,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:11:10,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:10,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:11:10,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:11:10,570 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2019-10-15 00:11:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:10,759 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2019-10-15 00:11:10,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 00:11:10,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-15 00:11:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:10,760 INFO L225 Difference]: With dead ends: 179 [2019-10-15 00:11:10,761 INFO L226 Difference]: Without dead ends: 137 [2019-10-15 00:11:10,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-15 00:11:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-15 00:11:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-10-15 00:11:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-15 00:11:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-10-15 00:11:10,767 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2019-10-15 00:11:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:10,767 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-10-15 00:11:10,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:11:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-10-15 00:11:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 00:11:10,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:10,768 INFO L380 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] [2019-10-15 00:11:10,769 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2019-10-15 00:11:10,770 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:10,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904727503] [2019-10-15 00:11:10,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:10,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:10,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:11,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904727503] [2019-10-15 00:11:11,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:11,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 00:11:11,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610742526] [2019-10-15 00:11:11,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 00:11:11,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 00:11:11,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 00:11:11,032 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 9 states. [2019-10-15 00:11:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:11,520 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2019-10-15 00:11:11,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 00:11:11,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-10-15 00:11:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:11,522 INFO L225 Difference]: With dead ends: 174 [2019-10-15 00:11:11,522 INFO L226 Difference]: Without dead ends: 172 [2019-10-15 00:11:11,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-10-15 00:11:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-15 00:11:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 104. [2019-10-15 00:11:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-15 00:11:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-10-15 00:11:11,530 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 28 [2019-10-15 00:11:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:11,530 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-10-15 00:11:11,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 00:11:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-10-15 00:11:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 00:11:11,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:11,531 INFO L380 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] [2019-10-15 00:11:11,532 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:11,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2019-10-15 00:11:11,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:11,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798975789] [2019-10-15 00:11:11,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:11,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:11,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 00:11:11,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798975789] [2019-10-15 00:11:11,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:11,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:11:11,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820457757] [2019-10-15 00:11:11,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:11:11,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:11,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:11:11,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:11:11,602 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 5 states. [2019-10-15 00:11:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:11,713 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2019-10-15 00:11:11,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:11:11,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-15 00:11:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:11,715 INFO L225 Difference]: With dead ends: 150 [2019-10-15 00:11:11,715 INFO L226 Difference]: Without dead ends: 132 [2019-10-15 00:11:11,716 INFO L600 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-10-15 00:11:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-15 00:11:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2019-10-15 00:11:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-15 00:11:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-10-15 00:11:11,723 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 30 [2019-10-15 00:11:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:11,724 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-10-15 00:11:11,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:11:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-10-15 00:11:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 00:11:11,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:11,725 INFO L380 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] [2019-10-15 00:11:11,725 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:11,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:11,726 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2019-10-15 00:11:11,726 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:11,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780744901] [2019-10-15 00:11:11,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:11,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:11,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 00:11:11,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780744901] [2019-10-15 00:11:11,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:11,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:11:11,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605572876] [2019-10-15 00:11:11,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:11:11,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:11,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:11:11,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:11:11,755 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 3 states. [2019-10-15 00:11:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:11,790 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2019-10-15 00:11:11,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:11:11,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 00:11:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:11,792 INFO L225 Difference]: With dead ends: 124 [2019-10-15 00:11:11,792 INFO L226 Difference]: Without dead ends: 122 [2019-10-15 00:11:11,793 INFO L600 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-10-15 00:11:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-15 00:11:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-10-15 00:11:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-15 00:11:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-10-15 00:11:11,800 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 30 [2019-10-15 00:11:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:11,800 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-10-15 00:11:11,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:11:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-10-15 00:11:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 00:11:11,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:11,801 INFO L380 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] [2019-10-15 00:11:11,802 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:11,802 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2019-10-15 00:11:11,802 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:11,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864711726] [2019-10-15 00:11:11,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:11,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:11,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:12,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864711726] [2019-10-15 00:11:12,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:11:12,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 00:11:12,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525436236] [2019-10-15 00:11:12,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 00:11:12,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:12,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 00:11:12,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 00:11:12,026 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 9 states. [2019-10-15 00:11:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:12,554 INFO L93 Difference]: Finished difference Result 200 states and 228 transitions. [2019-10-15 00:11:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 00:11:12,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-10-15 00:11:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:12,556 INFO L225 Difference]: With dead ends: 200 [2019-10-15 00:11:12,556 INFO L226 Difference]: Without dead ends: 198 [2019-10-15 00:11:12,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-10-15 00:11:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-15 00:11:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 129. [2019-10-15 00:11:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-15 00:11:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-10-15 00:11:12,564 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2019-10-15 00:11:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:12,565 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-10-15 00:11:12,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 00:11:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-10-15 00:11:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 00:11:12,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:11:12,566 INFO L380 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] [2019-10-15 00:11:12,566 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:11:12,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash -999338862, now seen corresponding path program 1 times [2019-10-15 00:11:12,567 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:11:12,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689611985] [2019-10-15 00:11:12,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:12,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:11:12,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:11:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:12,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689611985] [2019-10-15 00:11:12,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443934690] [2019-10-15 00:11:12,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:11:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:11:12,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-15 00:11:12,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:11:12,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-15 00:11:12,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:12,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:12,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-15 00:11:12,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:12,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:12,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:11:12,849 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-10-15 00:11:12,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:12,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-15 00:11:12,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:12,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:12,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:11:12,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-15 00:11:12,893 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:12,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:12,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:11:12,910 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-10-15 00:11:12,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-15 00:11:12,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:12,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:12,976 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:12,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-10-15 00:11:12,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:11:12,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:11:12,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:11:12,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-10-15 00:11:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:12,992 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:11:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:13,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [494702523] [2019-10-15 00:11:13,033 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 34 [2019-10-15 00:11:13,065 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 00:11:13,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 00:11:13,119 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 00:11:13,120 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 17 root evaluator evaluations with a maximum evaluation depth of 0. Performed 17 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 36 variables. [2019-10-15 00:11:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:13,123 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 00:11:13,162 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-15 00:11:13,162 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 00:11:13,164 INFO L553 sIntCurrentIteration]: We unified 32 AI predicates to 32 [2019-10-15 00:11:13,164 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 00:11:13,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 00:11:13,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 6, 5] total 8 [2019-10-15 00:11:13,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869775781] [2019-10-15 00:11:13,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:11:13,166 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:13,166 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 00:11:13,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:11:13,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:13,167 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 2 states. [2019-10-15 00:11:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:13,169 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2019-10-15 00:11:13,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:11:13,169 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2019-10-15 00:11:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:13,170 INFO L225 Difference]: With dead ends: 129 [2019-10-15 00:11:13,170 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 00:11:13,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-10-15 00:11:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 00:11:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 00:11:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 00:11:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 00:11:13,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-10-15 00:11:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:13,171 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 00:11:13,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:11:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 00:11:13,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 00:11:13,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:11:13,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 00:11:13,403 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:11:13,403 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:11:13,404 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:11:13,404 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:11:13,404 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 00:11:13,404 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:11:13,404 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:11:13,404 INFO L443 ceAbstractionStarter]: For program point L1026-1(line 1026) no Hoare annotation was computed. [2019-10-15 00:11:13,404 INFO L443 ceAbstractionStarter]: For program point L993-1(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,404 INFO L443 ceAbstractionStarter]: For program point L1026-3(line 1026) no Hoare annotation was computed. [2019-10-15 00:11:13,405 INFO L443 ceAbstractionStarter]: For program point L993-3(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,405 INFO L443 ceAbstractionStarter]: For program point L1026-4(lines 1019 1028) no Hoare annotation was computed. [2019-10-15 00:11:13,405 INFO L439 ceAbstractionStarter]: At program point L993-4(line 993) the Hoare annotation is: false [2019-10-15 00:11:13,405 INFO L443 ceAbstractionStarter]: For program point L1026-5(line 1026) no Hoare annotation was computed. [2019-10-15 00:11:13,405 INFO L443 ceAbstractionStarter]: For program point L993-5(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,405 INFO L443 ceAbstractionStarter]: For program point L993-6(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,405 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 988 1053) no Hoare annotation was computed. [2019-10-15 00:11:13,405 INFO L443 ceAbstractionStarter]: For program point L993-9(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,406 INFO L443 ceAbstractionStarter]: For program point L993-11(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,406 INFO L443 ceAbstractionStarter]: For program point L993-12(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,406 INFO L443 ceAbstractionStarter]: For program point L993-14(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,406 INFO L443 ceAbstractionStarter]: For program point L1043(line 1043) no Hoare annotation was computed. [2019-10-15 00:11:13,407 INFO L443 ceAbstractionStarter]: For program point L993-15(lines 989 1053) no Hoare annotation was computed. [2019-10-15 00:11:13,407 INFO L443 ceAbstractionStarter]: For program point L1043-1(line 1043) no Hoare annotation was computed. [2019-10-15 00:11:13,407 INFO L443 ceAbstractionStarter]: For program point L993-16(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,407 INFO L443 ceAbstractionStarter]: For program point L1043-3(line 1043) no Hoare annotation was computed. [2019-10-15 00:11:13,408 INFO L443 ceAbstractionStarter]: For program point L1043-4(lines 1040 1046) no Hoare annotation was computed. [2019-10-15 00:11:13,408 INFO L443 ceAbstractionStarter]: For program point L1043-5(line 1043) no Hoare annotation was computed. [2019-10-15 00:11:13,408 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1005) no Hoare annotation was computed. [2019-10-15 00:11:13,408 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1026) no Hoare annotation was computed. [2019-10-15 00:11:13,408 INFO L443 ceAbstractionStarter]: For program point L1012-1(line 1012) no Hoare annotation was computed. [2019-10-15 00:11:13,408 INFO L443 ceAbstractionStarter]: For program point L1012-3(line 1012) no Hoare annotation was computed. [2019-10-15 00:11:13,409 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:13,409 INFO L439 ceAbstractionStarter]: At program point L1012-4(line 1012) the Hoare annotation is: false [2019-10-15 00:11:13,409 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 988 1053) no Hoare annotation was computed. [2019-10-15 00:11:13,410 INFO L443 ceAbstractionStarter]: For program point L1029(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:13,410 INFO L443 ceAbstractionStarter]: For program point L1029-2(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:13,410 INFO L443 ceAbstractionStarter]: For program point L1029-3(lines 1015 1032) no Hoare annotation was computed. [2019-10-15 00:11:13,410 INFO L443 ceAbstractionStarter]: For program point L1029-4(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:13,410 INFO L443 ceAbstractionStarter]: For program point L1014-1(lines 989 1053) no Hoare annotation was computed. [2019-10-15 00:11:13,410 INFO L443 ceAbstractionStarter]: For program point L998-1(lines 998 1006) no Hoare annotation was computed. [2019-10-15 00:11:13,410 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1025) no Hoare annotation was computed. [2019-10-15 00:11:13,410 INFO L443 ceAbstractionStarter]: For program point L998-3(lines 998 1006) no Hoare annotation was computed. [2019-10-15 00:11:13,411 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,411 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1043) no Hoare annotation was computed. [2019-10-15 00:11:13,411 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1004) no Hoare annotation was computed. [2019-10-15 00:11:13,411 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 993) no Hoare annotation was computed. [2019-10-15 00:11:13,411 INFO L439 ceAbstractionStarter]: At program point L1018-2(lines 1018 1028) the Hoare annotation is: false [2019-10-15 00:11:13,411 INFO L443 ceAbstractionStarter]: For program point L1035-1(lines 989 1053) no Hoare annotation was computed. [2019-10-15 00:11:13,411 INFO L443 ceAbstractionStarter]: For program point L1035-2(lines 1035 1050) no Hoare annotation was computed. [2019-10-15 00:11:13,411 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1042) no Hoare annotation was computed. [2019-10-15 00:11:13,412 INFO L443 ceAbstractionStarter]: For program point L1020(lines 1020 1023) no Hoare annotation was computed. [2019-10-15 00:11:13,412 INFO L443 ceAbstractionStarter]: For program point L1004-1(line 1004) no Hoare annotation was computed. [2019-10-15 00:11:13,412 INFO L443 ceAbstractionStarter]: For program point L1004-3(line 1004) no Hoare annotation was computed. [2019-10-15 00:11:13,412 INFO L439 ceAbstractionStarter]: At program point L1004-4(line 1004) the Hoare annotation is: false [2019-10-15 00:11:13,412 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 988 1053) the Hoare annotation is: true [2019-10-15 00:11:13,413 INFO L443 ceAbstractionStarter]: For program point L1005(line 1005) no Hoare annotation was computed. [2019-10-15 00:11:13,413 INFO L443 ceAbstractionStarter]: For program point L1005-2(line 1005) no Hoare annotation was computed. [2019-10-15 00:11:13,413 INFO L443 ceAbstractionStarter]: For program point L1005-3(lines 999 1006) no Hoare annotation was computed. [2019-10-15 00:11:13,413 INFO L443 ceAbstractionStarter]: For program point L1005-4(line 1005) no Hoare annotation was computed. [2019-10-15 00:11:13,413 INFO L443 ceAbstractionStarter]: For program point L1005-5(line 1005) no Hoare annotation was computed. [2019-10-15 00:11:13,413 INFO L443 ceAbstractionStarter]: For program point L1005-8(line 1005) no Hoare annotation was computed. [2019-10-15 00:11:13,413 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:13,414 INFO L443 ceAbstractionStarter]: For program point L1005-10(line 1005) no Hoare annotation was computed. [2019-10-15 00:11:13,414 INFO L443 ceAbstractionStarter]: For program point L1005-11(line 1005) no Hoare annotation was computed. [2019-10-15 00:11:13,414 INFO L443 ceAbstractionStarter]: For program point L1005-13(line 1005) no Hoare annotation was computed. [2019-10-15 00:11:13,414 INFO L443 ceAbstractionStarter]: For program point L1005-14(lines 999 1006) no Hoare annotation was computed. [2019-10-15 00:11:13,414 INFO L439 ceAbstractionStarter]: At program point L1005-15(lines 998 1006) the Hoare annotation is: false [2019-10-15 00:11:13,414 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1046) no Hoare annotation was computed. [2019-10-15 00:11:13,414 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1046) no Hoare annotation was computed. [2019-10-15 00:11:13,414 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1005) no Hoare annotation was computed. [2019-10-15 00:11:13,415 INFO L443 ceAbstractionStarter]: For program point L1024(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:13,415 INFO L443 ceAbstractionStarter]: For program point L1024-2(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:13,415 INFO L443 ceAbstractionStarter]: For program point L1024-3(lines 1019 1028) no Hoare annotation was computed. [2019-10-15 00:11:13,415 INFO L443 ceAbstractionStarter]: For program point L1041-1(line 1041) no Hoare annotation was computed. [2019-10-15 00:11:13,415 INFO L443 ceAbstractionStarter]: For program point L1041-3(line 1041) no Hoare annotation was computed. [2019-10-15 00:11:13,415 INFO L439 ceAbstractionStarter]: At program point L1041-4(line 1041) the Hoare annotation is: false [2019-10-15 00:11:13,415 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-10-15 00:11:13,415 INFO L443 ceAbstractionStarter]: For program point L1025(line 1025) no Hoare annotation was computed. [2019-10-15 00:11:13,416 INFO L443 ceAbstractionStarter]: For program point L1025-1(line 1025) no Hoare annotation was computed. [2019-10-15 00:11:13,416 INFO L443 ceAbstractionStarter]: For program point L1025-3(line 1025) no Hoare annotation was computed. [2019-10-15 00:11:13,416 INFO L443 ceAbstractionStarter]: For program point L1025-4(lines 1019 1028) no Hoare annotation was computed. [2019-10-15 00:11:13,416 INFO L443 ceAbstractionStarter]: For program point L1042(line 1042) no Hoare annotation was computed. [2019-10-15 00:11:13,416 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-10-15 00:11:13,416 INFO L443 ceAbstractionStarter]: For program point L1042-3(line 1042) no Hoare annotation was computed. [2019-10-15 00:11:13,416 INFO L443 ceAbstractionStarter]: For program point L1042-4(lines 1040 1046) no Hoare annotation was computed. [2019-10-15 00:11:13,416 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1041) no Hoare annotation was computed. [2019-10-15 00:11:13,418 INFO L443 ceAbstractionStarter]: For program point L1026(line 1026) no Hoare annotation was computed. [2019-10-15 00:11:13,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:11:13 BoogieIcfgContainer [2019-10-15 00:11:13,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 00:11:13,434 INFO L168 Benchmark]: Toolchain (without parser) took 6081.84 ms. Allocated memory was 137.4 MB in the beginning and 294.1 MB in the end (delta: 156.8 MB). Free memory was 100.9 MB in the beginning and 151.6 MB in the end (delta: -50.7 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:13,443 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 00:11:13,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.39 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 167.7 MB in the end (delta: -67.0 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:13,447 INFO L168 Benchmark]: Boogie Preprocessor took 70.98 ms. Allocated memory is still 201.3 MB. Free memory was 167.7 MB in the beginning and 164.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:13,452 INFO L168 Benchmark]: RCFGBuilder took 745.23 ms. Allocated memory is still 201.3 MB. Free memory was 164.2 MB in the beginning and 109.4 MB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:13,453 INFO L168 Benchmark]: TraceAbstraction took 4639.27 ms. Allocated memory was 201.3 MB in the beginning and 294.1 MB in the end (delta: 92.8 MB). Free memory was 109.4 MB in the beginning and 151.6 MB in the end (delta: -42.2 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:13,459 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.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 621.39 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 167.7 MB in the end (delta: -67.0 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.98 ms. Allocated memory is still 201.3 MB. Free memory was 167.7 MB in the beginning and 164.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 745.23 ms. Allocated memory is still 201.3 MB. Free memory was 164.2 MB in the beginning and 109.4 MB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4639.27 ms. Allocated memory was 201.3 MB in the beginning and 294.1 MB in the end (delta: 92.8 MB). Free memory was 109.4 MB in the beginning and 151.6 MB in the end (delta: -42.2 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1043]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1042]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1005]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1005]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 993]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 993]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1004]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1041]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1024]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1029]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1025]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1026]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 1012]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 998]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1004]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1018]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 88 locations, 13 error locations. Result: SAFE, OverallTime: 4.5s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1035 SDtfs, 1245 SDslu, 1521 SDs, 0 SdLazy, 719 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 333 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 10 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 109903 SizeOfPredicates, 9 NumberOfNonLiveVariables, 114 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 5/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 91, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.96875, AVG_VARS_REMOVED_DURING_WEAKENING: 1.03125, AVG_WEAKENED_CONJUNCTS: 0.1875, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...