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/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 00:10:48,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:10:48,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:10:48,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:10:48,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:10:48,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:10:48,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:10:48,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:10:48,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:10:48,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:10:48,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:10:48,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:10:48,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:10:48,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:10:48,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:10:48,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:10:48,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:10:48,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:10:48,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:10:48,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:10:48,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:10:48,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:10:48,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:10:48,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:10:48,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:10:48,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:10:48,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:10:48,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:10:48,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:10:48,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:10:48,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:10:48,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:10:48,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:10:48,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:10:48,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:10:48,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:10:48,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:10:48,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:10:48,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:10:48,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:10:48,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:10:48,682 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:10:48,695 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:10:48,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:10:48,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:10:48,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:10:48,697 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:10:48,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:10:48,698 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:10:48,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:10:48,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:10:48,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:10:48,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:10:48,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:10:48,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:10:48,699 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:10:48,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:10:48,699 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:10:48,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:10:48,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:10:48,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:10:48,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:10:48,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:10:48,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:10:48,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:10:48,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:10:48,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:10:48,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:10:48,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:10:48,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:10:48,702 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:10:48,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:10:49,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:10:49,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:10:49,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:10:49,014 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:10:49,014 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-15 00:10:49,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1478fb18d/8597ea0736d7405e942fd577a269bc9b/FLAGc810fbb1b [2019-10-15 00:10:49,578 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:10:49,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-10-15 00:10:49,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1478fb18d/8597ea0736d7405e942fd577a269bc9b/FLAGc810fbb1b [2019-10-15 00:10:49,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1478fb18d/8597ea0736d7405e942fd577a269bc9b [2019-10-15 00:10:49,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:10:49,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:10:49,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:10:49,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:10:49,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:10:49,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:10:49" (1/1) ... [2019-10-15 00:10:49,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b94beeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:49, skipping insertion in model container [2019-10-15 00:10:49,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:10:49" (1/1) ... [2019-10-15 00:10:49,971 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:10:50,033 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:10:50,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:10:50,484 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:10:50,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:10:50,594 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:10:50,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:50 WrapperNode [2019-10-15 00:10:50,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:10:50,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:10:50,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:10:50,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:10:50,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:50" (1/1) ... [2019-10-15 00:10:50,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:50" (1/1) ... [2019-10-15 00:10:50,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:50" (1/1) ... [2019-10-15 00:10:50,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:50" (1/1) ... [2019-10-15 00:10:50,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:50" (1/1) ... [2019-10-15 00:10:50,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:50" (1/1) ... [2019-10-15 00:10:50,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:50" (1/1) ... [2019-10-15 00:10:50,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:10:50,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:10:50,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:10:50,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:10:50,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:50" (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:10:50,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:10:50,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:10:50,745 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:10:50,746 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 00:10:50,746 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 00:10:50,746 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 00:10:50,746 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 00:10:50,746 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 00:10:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 00:10:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 00:10:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 00:10:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 00:10:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 00:10:50,747 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 00:10:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 00:10:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 00:10:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 00:10:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 00:10:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 00:10:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 00:10:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 00:10:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 00:10:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 00:10:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 00:10:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 00:10:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 00:10:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 00:10:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 00:10:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 00:10:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 00:10:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 00:10:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 00:10:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 00:10:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 00:10:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 00:10:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 00:10:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 00:10:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 00:10:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 00:10:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 00:10:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 00:10:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 00:10:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 00:10:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 00:10:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 00:10:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 00:10:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 00:10:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 00:10:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 00:10:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 00:10:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 00:10:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 00:10:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 00:10:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 00:10:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 00:10:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 00:10:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 00:10:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 00:10:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 00:10:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 00:10:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 00:10:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 00:10:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 00:10:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 00:10:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 00:10:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 00:10:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:10:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 00:10:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 00:10:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 00:10:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 00:10:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 00:10:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 00:10:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 00:10:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 00:10:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 00:10:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 00:10:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 00:10:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 00:10:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 00:10:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 00:10:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 00:10:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 00:10:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 00:10:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 00:10:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 00:10:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 00:10:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 00:10:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 00:10:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 00:10:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 00:10:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 00:10:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 00:10:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 00:10:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 00:10:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 00:10:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 00:10:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 00:10:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 00:10:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 00:10:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 00:10:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 00:10:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 00:10:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 00:10:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 00:10:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 00:10:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:10:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:10:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:10:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 00:10:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 00:10:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 00:10:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 00:10:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:10:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:10:51,433 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:10:51,433 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-15 00:10:51,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:10:51 BoogieIcfgContainer [2019-10-15 00:10:51,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:10:51,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:10:51,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:10:51,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:10:51,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:10:49" (1/3) ... [2019-10-15 00:10:51,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e8603a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:10:51, skipping insertion in model container [2019-10-15 00:10:51,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:50" (2/3) ... [2019-10-15 00:10:51,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e8603a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:10:51, skipping insertion in model container [2019-10-15 00:10:51,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:10:51" (3/3) ... [2019-10-15 00:10:51,443 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-10-15 00:10:51,452 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:10:51,460 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-10-15 00:10:51,471 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-10-15 00:10:51,498 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:10:51,498 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:10:51,498 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:10:51,498 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:10:51,499 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:10:51,500 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:10:51,503 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:10:51,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:10:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-10-15 00:10:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-15 00:10:51,539 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:51,540 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:10:51,542 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2019-10-15 00:10:51,558 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:51,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278039137] [2019-10-15 00:10:51,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:51,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:51,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:51,745 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:10:51,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278039137] [2019-10-15 00:10:51,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:51,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:10:51,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686674089] [2019-10-15 00:10:51,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:10:51,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:51,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:10:51,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:10:51,771 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-10-15 00:10:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:51,850 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2019-10-15 00:10:51,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:10:51,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-15 00:10:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:51,863 INFO L225 Difference]: With dead ends: 186 [2019-10-15 00:10:51,863 INFO L226 Difference]: Without dead ends: 99 [2019-10-15 00:10:51,867 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:10:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-15 00:10:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2019-10-15 00:10:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-15 00:10:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-10-15 00:10:51,931 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2019-10-15 00:10:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:51,932 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-10-15 00:10:51,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:10:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-10-15 00:10:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 00:10:51,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:51,933 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:10:51,933 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:51,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2019-10-15 00:10:51,934 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:51,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985377407] [2019-10-15 00:10:51,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:51,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:51,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:51,978 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:10:51,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985377407] [2019-10-15 00:10:51,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:51,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:10:51,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331260703] [2019-10-15 00:10:51,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:10:51,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:10:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:10:51,982 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 3 states. [2019-10-15 00:10:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:51,998 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-10-15 00:10:51,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:10:51,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-15 00:10:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:52,000 INFO L225 Difference]: With dead ends: 84 [2019-10-15 00:10:52,001 INFO L226 Difference]: Without dead ends: 82 [2019-10-15 00:10:52,001 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:10:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-15 00:10:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-10-15 00:10:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-15 00:10:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-10-15 00:10:52,010 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2019-10-15 00:10:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:52,011 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-10-15 00:10:52,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:10:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-10-15 00:10:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 00:10:52,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:52,012 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:10:52,012 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:52,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2019-10-15 00:10:52,013 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:52,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158591761] [2019-10-15 00:10:52,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:52,090 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:10:52,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158591761] [2019-10-15 00:10:52,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:52,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:10:52,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530560634] [2019-10-15 00:10:52,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:10:52,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:52,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:10:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:10:52,095 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 4 states. [2019-10-15 00:10:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:52,167 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-10-15 00:10:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:10:52,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 00:10:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:52,169 INFO L225 Difference]: With dead ends: 84 [2019-10-15 00:10:52,171 INFO L226 Difference]: Without dead ends: 82 [2019-10-15 00:10:52,171 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:10:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-15 00:10:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-10-15 00:10:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-15 00:10:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-10-15 00:10:52,179 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2019-10-15 00:10:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:52,180 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-10-15 00:10:52,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:10:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-10-15 00:10:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 00:10:52,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:52,181 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:10:52,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2019-10-15 00:10:52,182 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:52,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649292482] [2019-10-15 00:10:52,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:52,291 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:10:52,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649292482] [2019-10-15 00:10:52,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:52,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:10:52,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714147965] [2019-10-15 00:10:52,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:10:52,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:10:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:10:52,299 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 4 states. [2019-10-15 00:10:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:52,441 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2019-10-15 00:10:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:10:52,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 00:10:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:52,444 INFO L225 Difference]: With dead ends: 199 [2019-10-15 00:10:52,444 INFO L226 Difference]: Without dead ends: 132 [2019-10-15 00:10:52,449 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:10:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-15 00:10:52,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2019-10-15 00:10:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-15 00:10:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-10-15 00:10:52,468 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2019-10-15 00:10:52,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:52,470 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-10-15 00:10:52,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:10:52,470 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-10-15 00:10:52,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 00:10:52,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:52,471 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:10:52,471 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:52,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:52,472 INFO L82 PathProgramCache]: Analyzing trace with hash -631612141, now seen corresponding path program 1 times [2019-10-15 00:10:52,472 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:52,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176646998] [2019-10-15 00:10:52,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:52,596 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:10:52,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176646998] [2019-10-15 00:10:52,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:52,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:10:52,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553810733] [2019-10-15 00:10:52,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:10:52,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:52,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:10:52,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:10:52,598 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 5 states. [2019-10-15 00:10:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:52,711 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-10-15 00:10:52,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 00:10:52,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-15 00:10:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:52,713 INFO L225 Difference]: With dead ends: 126 [2019-10-15 00:10:52,713 INFO L226 Difference]: Without dead ends: 122 [2019-10-15 00:10:52,713 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:10:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-15 00:10:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-10-15 00:10:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-15 00:10:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-10-15 00:10:52,721 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2019-10-15 00:10:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:52,721 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-10-15 00:10:52,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:10:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-10-15 00:10:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 00:10:52,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:52,722 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:10:52,723 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:52,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1894864309, now seen corresponding path program 1 times [2019-10-15 00:10:52,723 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:52,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750342594] [2019-10-15 00:10:52,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:52,784 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:10:52,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750342594] [2019-10-15 00:10:52,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:52,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:10:52,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104550735] [2019-10-15 00:10:52,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:10:52,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:52,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:10:52,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:10:52,786 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 5 states. [2019-10-15 00:10:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:52,872 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2019-10-15 00:10:52,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:10:52,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-15 00:10:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:52,873 INFO L225 Difference]: With dead ends: 136 [2019-10-15 00:10:52,873 INFO L226 Difference]: Without dead ends: 116 [2019-10-15 00:10:52,874 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:10:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-15 00:10:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2019-10-15 00:10:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-15 00:10:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-10-15 00:10:52,881 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2019-10-15 00:10:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:52,881 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-10-15 00:10:52,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:10:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-10-15 00:10:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 00:10:52,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:52,882 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:10:52,883 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:52,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:52,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1337316768, now seen corresponding path program 1 times [2019-10-15 00:10:52,883 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:52,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900985976] [2019-10-15 00:10:52,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:52,914 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:10:52,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900985976] [2019-10-15 00:10:52,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:52,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:10:52,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518196064] [2019-10-15 00:10:52,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:10:52,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:10:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:10:52,916 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 3 states. [2019-10-15 00:10:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:52,928 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2019-10-15 00:10:52,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:10:52,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 00:10:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:52,930 INFO L225 Difference]: With dead ends: 141 [2019-10-15 00:10:52,930 INFO L226 Difference]: Without dead ends: 100 [2019-10-15 00:10:52,931 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:10:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-15 00:10:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2019-10-15 00:10:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-15 00:10:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-10-15 00:10:52,937 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2019-10-15 00:10:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:52,938 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-10-15 00:10:52,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:10:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-10-15 00:10:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 00:10:52,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:52,939 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:10:52,940 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:52,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1492857654, now seen corresponding path program 1 times [2019-10-15 00:10:52,940 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:52,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507444676] [2019-10-15 00:10:52,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:52,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:52,983 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:10:52,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507444676] [2019-10-15 00:10:52,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:52,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:10:52,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969336200] [2019-10-15 00:10:52,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:10:52,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:52,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:10:52,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:10:52,987 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 3 states. [2019-10-15 00:10:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:53,003 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2019-10-15 00:10:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:10:53,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 00:10:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:53,004 INFO L225 Difference]: With dead ends: 79 [2019-10-15 00:10:53,004 INFO L226 Difference]: Without dead ends: 77 [2019-10-15 00:10:53,005 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:10:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-15 00:10:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-15 00:10:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-15 00:10:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-10-15 00:10:53,010 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2019-10-15 00:10:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:53,011 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-10-15 00:10:53,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:10:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-10-15 00:10:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 00:10:53,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:53,012 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:10:53,013 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:53,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1632693981, now seen corresponding path program 1 times [2019-10-15 00:10:53,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:53,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743446415] [2019-10-15 00:10:53,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:53,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:53,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:53,069 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:10:53,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743446415] [2019-10-15 00:10:53,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:53,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:10:53,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018922637] [2019-10-15 00:10:53,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:10:53,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:10:53,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:10:53,073 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2019-10-15 00:10:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:53,156 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2019-10-15 00:10:53,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:10:53,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-15 00:10:53,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:53,157 INFO L225 Difference]: With dead ends: 78 [2019-10-15 00:10:53,158 INFO L226 Difference]: Without dead ends: 76 [2019-10-15 00:10:53,158 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:10:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-15 00:10:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-10-15 00:10:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-15 00:10:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-10-15 00:10:53,163 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2019-10-15 00:10:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:53,164 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-10-15 00:10:53,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:10:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-10-15 00:10:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 00:10:53,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:53,165 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:10:53,176 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:53,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:53,177 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2019-10-15 00:10:53,177 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:53,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680437875] [2019-10-15 00:10:53,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:53,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:53,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:53,281 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:10:53,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680437875] [2019-10-15 00:10:53,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:53,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:10:53,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937458723] [2019-10-15 00:10:53,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:10:53,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:53,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:10:53,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:10:53,284 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2019-10-15 00:10:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:53,495 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2019-10-15 00:10:53,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 00:10:53,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-15 00:10:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:53,497 INFO L225 Difference]: With dead ends: 179 [2019-10-15 00:10:53,497 INFO L226 Difference]: Without dead ends: 137 [2019-10-15 00:10:53,498 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:10:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-15 00:10:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-10-15 00:10:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-15 00:10:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-10-15 00:10:53,515 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2019-10-15 00:10:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:53,515 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-10-15 00:10:53,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:10:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-10-15 00:10:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 00:10:53,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:53,520 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:10:53,521 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:53,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:53,521 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2019-10-15 00:10:53,522 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:53,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089443086] [2019-10-15 00:10:53,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:53,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:53,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:53,805 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:10:53,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089443086] [2019-10-15 00:10:53,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:53,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 00:10:53,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737750151] [2019-10-15 00:10:53,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 00:10:53,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:53,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 00:10:53,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 00:10:53,807 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 9 states. [2019-10-15 00:10:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:54,624 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2019-10-15 00:10:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 00:10:54,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-10-15 00:10:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:54,628 INFO L225 Difference]: With dead ends: 175 [2019-10-15 00:10:54,628 INFO L226 Difference]: Without dead ends: 173 [2019-10-15 00:10:54,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-10-15 00:10:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-15 00:10:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 104. [2019-10-15 00:10:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-15 00:10:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-10-15 00:10:54,637 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 28 [2019-10-15 00:10:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:54,638 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-10-15 00:10:54,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 00:10:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-10-15 00:10:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 00:10:54,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:54,639 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:10:54,639 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2019-10-15 00:10:54,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:54,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237943786] [2019-10-15 00:10:54,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:54,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:54,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:54,697 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:10:54,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237943786] [2019-10-15 00:10:54,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:54,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:10:54,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587443350] [2019-10-15 00:10:54,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:10:54,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:54,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:10:54,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:10:54,700 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 5 states. [2019-10-15 00:10:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:54,800 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2019-10-15 00:10:54,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:10:54,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-15 00:10:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:54,801 INFO L225 Difference]: With dead ends: 151 [2019-10-15 00:10:54,802 INFO L226 Difference]: Without dead ends: 133 [2019-10-15 00:10:54,802 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:10:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-15 00:10:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2019-10-15 00:10:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-15 00:10:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-10-15 00:10:54,811 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 30 [2019-10-15 00:10:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:54,811 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-10-15 00:10:54,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:10:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-10-15 00:10:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 00:10:54,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:54,813 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:10:54,813 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:54,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2019-10-15 00:10:54,814 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:54,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924014369] [2019-10-15 00:10:54,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:54,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:54,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:54,838 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:10:54,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924014369] [2019-10-15 00:10:54,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:54,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:10:54,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602344692] [2019-10-15 00:10:54,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:10:54,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:54,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:10:54,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:10:54,840 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 3 states. [2019-10-15 00:10:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:54,884 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-10-15 00:10:54,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:10:54,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 00:10:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:54,885 INFO L225 Difference]: With dead ends: 125 [2019-10-15 00:10:54,885 INFO L226 Difference]: Without dead ends: 123 [2019-10-15 00:10:54,886 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:10:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-15 00:10:54,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-10-15 00:10:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-15 00:10:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-10-15 00:10:54,894 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 30 [2019-10-15 00:10:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:54,894 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-10-15 00:10:54,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:10:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-10-15 00:10:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 00:10:54,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:54,896 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:10:54,896 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:54,897 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2019-10-15 00:10:54,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:54,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084191651] [2019-10-15 00:10:54,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:54,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:54,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:55,102 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:10:55,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084191651] [2019-10-15 00:10:55,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:55,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 00:10:55,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977539664] [2019-10-15 00:10:55,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 00:10:55,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:55,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 00:10:55,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 00:10:55,104 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 9 states. [2019-10-15 00:10:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:55,713 INFO L93 Difference]: Finished difference Result 201 states and 229 transitions. [2019-10-15 00:10:55,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 00:10:55,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-10-15 00:10:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:55,715 INFO L225 Difference]: With dead ends: 201 [2019-10-15 00:10:55,715 INFO L226 Difference]: Without dead ends: 199 [2019-10-15 00:10:55,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-10-15 00:10:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-15 00:10:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 129. [2019-10-15 00:10:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-15 00:10:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-10-15 00:10:55,725 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2019-10-15 00:10:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:55,725 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-10-15 00:10:55,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 00:10:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-10-15 00:10:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 00:10:55,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:55,727 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:10:55,727 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:55,728 INFO L82 PathProgramCache]: Analyzing trace with hash -999338862, now seen corresponding path program 1 times [2019-10-15 00:10:55,728 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:55,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894429398] [2019-10-15 00:10:55,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:55,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:55,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:55,778 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:10:55,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894429398] [2019-10-15 00:10:55,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561761698] [2019-10-15 00:10:55,779 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:10:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:55,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-15 00:10:55,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:10:55,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:10:55,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-15 00:10:55,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:10:55,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:55,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:10:55,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-15 00:10:55,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:10:55,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:55,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:10:55,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:36 [2019-10-15 00:10:56,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:10:56,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:10:56,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:10:56,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-15 00:10:56,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:10:56,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:56,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:10:56,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:10:56,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:10:56,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-15 00:10:56,053 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:10:56,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:56,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:10:56,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-10-15 00:10:56,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-15 00:10:56,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:10:56,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:56,145 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:56,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-10-15 00:10:56,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:10:56,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:56,152 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:10:56,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-10-15 00:10:56,162 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:10:56,162 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:10:56,189 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:10:56,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [471327167] [2019-10-15 00:10:56,196 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 34 [2019-10-15 00:10:56,244 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 00:10:56,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 00:10:56,337 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 00:10:56,339 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:10:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:56,344 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 00:10:56,399 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-15 00:10:56,400 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 00:10:56,401 INFO L553 sIntCurrentIteration]: We unified 32 AI predicates to 32 [2019-10-15 00:10:56,402 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 00:10:56,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 00:10:56,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 6, 5] total 8 [2019-10-15 00:10:56,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197905530] [2019-10-15 00:10:56,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:10:56,406 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:56,406 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 00:10:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:10:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:10:56,407 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 2 states. [2019-10-15 00:10:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:56,411 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2019-10-15 00:10:56,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:10:56,411 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2019-10-15 00:10:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:56,412 INFO L225 Difference]: With dead ends: 129 [2019-10-15 00:10:56,412 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 00:10:56,416 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:10:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 00:10:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 00:10:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 00:10:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 00:10:56,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-10-15 00:10:56,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:56,417 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 00:10:56,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:10:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 00:10:56,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 00:10:56,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:10:56,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 00:10:56,652 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:10:56,653 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:10:56,653 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:10:56,653 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:10:56,653 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 00:10:56,654 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:10:56,654 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:10:56,654 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 989 1056) no Hoare annotation was computed. [2019-10-15 00:10:56,654 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1007) no Hoare annotation was computed. [2019-10-15 00:10:56,654 INFO L443 ceAbstractionStarter]: For program point L1027(line 1027) no Hoare annotation was computed. [2019-10-15 00:10:56,654 INFO L443 ceAbstractionStarter]: For program point L1027-2(line 1027) no Hoare annotation was computed. [2019-10-15 00:10:56,655 INFO L443 ceAbstractionStarter]: For program point L1027-3(lines 1022 1031) no Hoare annotation was computed. [2019-10-15 00:10:56,655 INFO L443 ceAbstractionStarter]: For program point L1044-1(line 1044) no Hoare annotation was computed. [2019-10-15 00:10:56,655 INFO L443 ceAbstractionStarter]: For program point L1044-3(line 1044) no Hoare annotation was computed. [2019-10-15 00:10:56,655 INFO L439 ceAbstractionStarter]: At program point L1044-4(line 1044) the Hoare annotation is: false [2019-10-15 00:10:56,655 INFO L443 ceAbstractionStarter]: For program point L1028(line 1028) no Hoare annotation was computed. [2019-10-15 00:10:56,655 INFO L443 ceAbstractionStarter]: For program point L1028-1(line 1028) no Hoare annotation was computed. [2019-10-15 00:10:56,656 INFO L443 ceAbstractionStarter]: For program point L995-1(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,656 INFO L443 ceAbstractionStarter]: For program point L1028-3(line 1028) no Hoare annotation was computed. [2019-10-15 00:10:56,656 INFO L443 ceAbstractionStarter]: For program point L995-3(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,656 INFO L443 ceAbstractionStarter]: For program point L1028-4(lines 1022 1031) no Hoare annotation was computed. [2019-10-15 00:10:56,656 INFO L439 ceAbstractionStarter]: At program point L995-4(line 995) the Hoare annotation is: false [2019-10-15 00:10:56,656 INFO L443 ceAbstractionStarter]: For program point L995-5(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,656 INFO L443 ceAbstractionStarter]: For program point L995-6(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,657 INFO L443 ceAbstractionStarter]: For program point L995-9(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,657 INFO L443 ceAbstractionStarter]: For program point L995-11(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,657 INFO L443 ceAbstractionStarter]: For program point L995-12(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,657 INFO L443 ceAbstractionStarter]: For program point L995-14(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,657 INFO L443 ceAbstractionStarter]: For program point L1045(line 1045) no Hoare annotation was computed. [2019-10-15 00:10:56,657 INFO L443 ceAbstractionStarter]: For program point L995-15(lines 990 1056) no Hoare annotation was computed. [2019-10-15 00:10:56,658 INFO L443 ceAbstractionStarter]: For program point L1045-1(line 1045) no Hoare annotation was computed. [2019-10-15 00:10:56,658 INFO L443 ceAbstractionStarter]: For program point L995-16(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,658 INFO L443 ceAbstractionStarter]: For program point L1045-3(line 1045) no Hoare annotation was computed. [2019-10-15 00:10:56,658 INFO L443 ceAbstractionStarter]: For program point L1045-4(lines 1043 1049) no Hoare annotation was computed. [2019-10-15 00:10:56,658 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1029) no Hoare annotation was computed. [2019-10-15 00:10:56,658 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 989 1056) no Hoare annotation was computed. [2019-10-15 00:10:56,659 INFO L443 ceAbstractionStarter]: For program point L1029(line 1029) no Hoare annotation was computed. [2019-10-15 00:10:56,659 INFO L443 ceAbstractionStarter]: For program point L1029-1(line 1029) no Hoare annotation was computed. [2019-10-15 00:10:56,659 INFO L443 ceAbstractionStarter]: For program point L1029-3(line 1029) no Hoare annotation was computed. [2019-10-15 00:10:56,659 INFO L443 ceAbstractionStarter]: For program point L1029-4(lines 1022 1031) no Hoare annotation was computed. [2019-10-15 00:10:56,659 INFO L443 ceAbstractionStarter]: For program point L1029-5(line 1029) no Hoare annotation was computed. [2019-10-15 00:10:56,659 INFO L443 ceAbstractionStarter]: For program point L1046(line 1046) no Hoare annotation was computed. [2019-10-15 00:10:56,659 INFO L443 ceAbstractionStarter]: For program point L1046-1(line 1046) no Hoare annotation was computed. [2019-10-15 00:10:56,660 INFO L443 ceAbstractionStarter]: For program point L1046-3(line 1046) no Hoare annotation was computed. [2019-10-15 00:10:56,660 INFO L443 ceAbstractionStarter]: For program point L1046-4(lines 1043 1049) no Hoare annotation was computed. [2019-10-15 00:10:56,660 INFO L443 ceAbstractionStarter]: For program point L1046-5(line 1046) no Hoare annotation was computed. [2019-10-15 00:10:56,660 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1008) no Hoare annotation was computed. [2019-10-15 00:10:56,660 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1027) no Hoare annotation was computed. [2019-10-15 00:10:56,660 INFO L443 ceAbstractionStarter]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2019-10-15 00:10:56,660 INFO L443 ceAbstractionStarter]: For program point L1015-3(line 1015) no Hoare annotation was computed. [2019-10-15 00:10:56,661 INFO L439 ceAbstractionStarter]: At program point L1015-4(line 1015) the Hoare annotation is: false [2019-10-15 00:10:56,661 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,661 INFO L443 ceAbstractionStarter]: For program point L1032(line 1032) no Hoare annotation was computed. [2019-10-15 00:10:56,661 INFO L443 ceAbstractionStarter]: For program point L1032-2(line 1032) no Hoare annotation was computed. [2019-10-15 00:10:56,661 INFO L443 ceAbstractionStarter]: For program point L1032-3(lines 1018 1035) no Hoare annotation was computed. [2019-10-15 00:10:56,661 INFO L443 ceAbstractionStarter]: For program point L1032-4(line 1032) no Hoare annotation was computed. [2019-10-15 00:10:56,662 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1046) no Hoare annotation was computed. [2019-10-15 00:10:56,662 INFO L443 ceAbstractionStarter]: For program point L1000-1(lines 1000 1009) no Hoare annotation was computed. [2019-10-15 00:10:56,662 INFO L443 ceAbstractionStarter]: For program point L1000-3(lines 1000 1009) no Hoare annotation was computed. [2019-10-15 00:10:56,662 INFO L443 ceAbstractionStarter]: For program point L1017-1(lines 990 1056) no Hoare annotation was computed. [2019-10-15 00:10:56,662 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1028) no Hoare annotation was computed. [2019-10-15 00:10:56,662 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1044) no Hoare annotation was computed. [2019-10-15 00:10:56,663 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1015) no Hoare annotation was computed. [2019-10-15 00:10:56,663 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 989 1056) the Hoare annotation is: true [2019-10-15 00:10:56,663 INFO L439 ceAbstractionStarter]: At program point L1021-2(lines 1021 1031) the Hoare annotation is: false [2019-10-15 00:10:56,663 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 995) no Hoare annotation was computed. [2019-10-15 00:10:56,663 INFO L443 ceAbstractionStarter]: For program point L1038-1(lines 990 1056) no Hoare annotation was computed. [2019-10-15 00:10:56,663 INFO L443 ceAbstractionStarter]: For program point L1038-2(lines 1038 1053) no Hoare annotation was computed. [2019-10-15 00:10:56,663 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1045) no Hoare annotation was computed. [2019-10-15 00:10:56,664 INFO L443 ceAbstractionStarter]: For program point L1023(lines 1023 1026) no Hoare annotation was computed. [2019-10-15 00:10:56,664 INFO L443 ceAbstractionStarter]: For program point L1007-1(line 1007) no Hoare annotation was computed. [2019-10-15 00:10:56,664 INFO L443 ceAbstractionStarter]: For program point L1007-3(line 1007) no Hoare annotation was computed. [2019-10-15 00:10:56,664 INFO L439 ceAbstractionStarter]: At program point L1007-4(line 1007) the Hoare annotation is: false [2019-10-15 00:10:56,664 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1032) no Hoare annotation was computed. [2019-10-15 00:10:56,664 INFO L443 ceAbstractionStarter]: For program point L1008(line 1008) no Hoare annotation was computed. [2019-10-15 00:10:56,664 INFO L443 ceAbstractionStarter]: For program point L1008-2(line 1008) no Hoare annotation was computed. [2019-10-15 00:10:56,665 INFO L443 ceAbstractionStarter]: For program point L1008-3(lines 1001 1009) no Hoare annotation was computed. [2019-10-15 00:10:56,665 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1008) no Hoare annotation was computed. [2019-10-15 00:10:56,665 INFO L443 ceAbstractionStarter]: For program point L1008-4(line 1008) no Hoare annotation was computed. [2019-10-15 00:10:56,665 INFO L443 ceAbstractionStarter]: For program point L1008-5(line 1008) no Hoare annotation was computed. [2019-10-15 00:10:56,665 INFO L443 ceAbstractionStarter]: For program point L1008-8(line 1008) no Hoare annotation was computed. [2019-10-15 00:10:56,665 INFO L443 ceAbstractionStarter]: For program point L1008-10(line 1008) no Hoare annotation was computed. [2019-10-15 00:10:56,665 INFO L443 ceAbstractionStarter]: For program point L1008-11(line 1008) no Hoare annotation was computed. [2019-10-15 00:10:56,666 INFO L443 ceAbstractionStarter]: For program point L1008-13(line 1008) no Hoare annotation was computed. [2019-10-15 00:10:56,666 INFO L443 ceAbstractionStarter]: For program point L1008-14(lines 1001 1009) no Hoare annotation was computed. [2019-10-15 00:10:56,666 INFO L439 ceAbstractionStarter]: At program point L1008-15(lines 1000 1009) the Hoare annotation is: false [2019-10-15 00:10:56,666 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1049) no Hoare annotation was computed. [2019-10-15 00:10:56,666 INFO L443 ceAbstractionStarter]: For program point L1042-2(lines 1042 1049) no Hoare annotation was computed. [2019-10-15 00:10:56,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:10:56 BoogieIcfgContainer [2019-10-15 00:10:56,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 00:10:56,677 INFO L168 Benchmark]: Toolchain (without parser) took 6721.26 ms. Allocated memory was 137.4 MB in the beginning and 291.0 MB in the end (delta: 153.6 MB). Free memory was 100.0 MB in the beginning and 84.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 169.6 MB. Max. memory is 7.1 GB. [2019-10-15 00:10:56,678 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 119.4 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-15 00:10:56,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.21 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 169.1 MB in the end (delta: -69.3 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2019-10-15 00:10:56,679 INFO L168 Benchmark]: Boogie Preprocessor took 92.28 ms. Allocated memory is still 201.9 MB. Free memory was 169.1 MB in the beginning and 165.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-10-15 00:10:56,680 INFO L168 Benchmark]: RCFGBuilder took 747.22 ms. Allocated memory is still 201.9 MB. Free memory was 165.3 MB in the beginning and 109.9 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. [2019-10-15 00:10:56,681 INFO L168 Benchmark]: TraceAbstraction took 5239.10 ms. Allocated memory was 201.9 MB in the beginning and 291.0 MB in the end (delta: 89.1 MB). Free memory was 109.2 MB in the beginning and 84.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. [2019-10-15 00:10:56,684 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 119.4 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 638.21 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 169.1 MB in the end (delta: -69.3 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 92.28 ms. Allocated memory is still 201.9 MB. Free memory was 169.1 MB in the beginning and 165.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 747.22 ms. Allocated memory is still 201.9 MB. Free memory was 165.3 MB in the beginning and 109.9 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5239.10 ms. Allocated memory was 201.9 MB in the beginning and 291.0 MB in the end (delta: 89.1 MB). Free memory was 109.2 MB in the beginning and 84.1 MB in the end (delta: 25.1 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1007]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1032]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1008]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 995]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1008]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 995]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1015]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1028]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1027]: 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: 1046]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1044]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1045]: 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: 1044]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1000]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1007]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1021]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 88 locations, 13 error locations. Result: SAFE, OverallTime: 5.1s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1021 SDtfs, 1382 SDslu, 1559 SDs, 0 SdLazy, 779 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.4s 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, 380 StatesRemovedByMinimization, 12 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.3s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 122324 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]: 149, 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...