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-queue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 00:10:54,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:10:54,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:10:54,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:10:54,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:10:54,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:10:54,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:10:54,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:10:54,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:10:54,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:10:54,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:10:54,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:10:54,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:10:54,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:10:54,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:10:54,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:10:54,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:10:54,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:10:54,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:10:54,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:10:54,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:10:54,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:10:54,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:10:54,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:10:54,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:10:54,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:10:54,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:10:54,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:10:54,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:10:54,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:10:54,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:10:54,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:10:54,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:10:54,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:10:54,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:10:54,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:10:54,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:10:54,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:10:54,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:10:54,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:10:54,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:10:54,553 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:54,578 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:10:54,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:10:54,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:10:54,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:10:54,583 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:10:54,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:10:54,584 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:10:54,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:10:54,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:10:54,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:10:54,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:10:54,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:10:54,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:10:54,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:10:54,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:10:54,586 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:10:54,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:10:54,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:10:54,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:10:54,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:10:54,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:10:54,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:10:54,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:10:54,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:10:54,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:10:54,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:10:54,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:10:54,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:10:54,589 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:54,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:10:54,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:10:54,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:10:54,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:10:54,907 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:10:54,908 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue-1.i [2019-10-15 00:10:54,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c1ee3a8a/8ef62b5bb2bb40608e724bd6d6367a9c/FLAGd694ef2aa [2019-10-15 00:10:55,515 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:10:55,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-queue-1.i [2019-10-15 00:10:55,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c1ee3a8a/8ef62b5bb2bb40608e724bd6d6367a9c/FLAGd694ef2aa [2019-10-15 00:10:55,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c1ee3a8a/8ef62b5bb2bb40608e724bd6d6367a9c [2019-10-15 00:10:55,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:10:55,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:10:55,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:10:55,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:10:55,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:10:55,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:10:55" (1/1) ... [2019-10-15 00:10:55,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4090d242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:55, skipping insertion in model container [2019-10-15 00:10:55,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:10:55" (1/1) ... [2019-10-15 00:10:55,833 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:10:55,886 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:10:56,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:10:56,353 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:10:56,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:10:56,511 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:10:56,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:56 WrapperNode [2019-10-15 00:10:56,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:10:56,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:10:56,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:10:56,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:10:56,524 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:56" (1/1) ... [2019-10-15 00:10:56,524 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:56" (1/1) ... [2019-10-15 00:10:56,541 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:56" (1/1) ... [2019-10-15 00:10:56,541 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:56" (1/1) ... [2019-10-15 00:10:56,562 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:56" (1/1) ... [2019-10-15 00:10:56,572 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:56" (1/1) ... [2019-10-15 00:10:56,577 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:56" (1/1) ... [2019-10-15 00:10:56,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:10:56,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:10:56,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:10:56,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:10:56,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:56" (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:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:10:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:10:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:10:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-15 00:10:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-15 00:10:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-15 00:10:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-15 00:10:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-15 00:10:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-15 00:10:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-15 00:10:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-15 00:10:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-15 00:10:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-15 00:10:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-15 00:10:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-15 00:10:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-15 00:10:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-15 00:10:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-15 00:10:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-15 00:10:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-15 00:10:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-15 00:10:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-15 00:10:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-15 00:10:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-15 00:10:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-15 00:10:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-15 00:10:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-15 00:10:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-15 00:10:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-15 00:10:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-15 00:10:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-15 00:10:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-15 00:10:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-15 00:10:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-15 00:10:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-15 00:10:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-15 00:10:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-15 00:10:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-15 00:10:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-15 00:10:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-15 00:10:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-15 00:10:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-15 00:10:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-15 00:10:56,653 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-15 00:10:56,653 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-15 00:10:56,653 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-15 00:10:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-15 00:10:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-15 00:10:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-15 00:10:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-15 00:10:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-15 00:10:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-15 00:10:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-15 00:10:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 00:10:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 00:10:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 00:10:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 00:10:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 00:10:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-15 00:10:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 00:10:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-15 00:10:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-15 00:10:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-15 00:10:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-15 00:10:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-15 00:10:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-15 00:10:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:10:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-15 00:10:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-15 00:10:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-15 00:10:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-15 00:10:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-15 00:10:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-15 00:10:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-15 00:10:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-15 00:10:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-15 00:10:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-15 00:10:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-15 00:10:56,662 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-15 00:10:56,663 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-15 00:10:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-15 00:10:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-15 00:10:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-15 00:10:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-15 00:10:56,664 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-15 00:10:56,665 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-15 00:10:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-15 00:10:56,666 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-15 00:10:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-15 00:10:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-15 00:10:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-15 00:10:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-15 00:10:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-15 00:10:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-15 00:10:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-15 00:10:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-15 00:10:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-15 00:10:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-15 00:10:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-15 00:10:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-15 00:10:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-15 00:10:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-15 00:10:56,668 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-15 00:10:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-15 00:10:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-15 00:10:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-15 00:10:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:10:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:10:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:10:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 00:10:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 00:10:56,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 00:10:56,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 00:10:56,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 00:10:56,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 00:10:56,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:10:56,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:10:57,377 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:10:57,378 INFO L284 CfgBuilder]: Removed 31 assume(true) statements. [2019-10-15 00:10:57,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:10:57 BoogieIcfgContainer [2019-10-15 00:10:57,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:10:57,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:10:57,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:10:57,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:10:57,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:10:55" (1/3) ... [2019-10-15 00:10:57,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3f6891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:10:57, skipping insertion in model container [2019-10-15 00:10:57,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:10:56" (2/3) ... [2019-10-15 00:10:57,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3f6891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:10:57, skipping insertion in model container [2019-10-15 00:10:57,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:10:57" (3/3) ... [2019-10-15 00:10:57,387 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2019-10-15 00:10:57,397 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:10:57,405 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-10-15 00:10:57,417 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-10-15 00:10:57,444 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:10:57,444 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:10:57,444 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:10:57,444 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:10:57,445 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:10:57,445 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:10:57,445 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:10:57,445 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:10:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-10-15 00:10:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-15 00:10:57,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:57,475 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:10:57,478 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash 786631415, now seen corresponding path program 1 times [2019-10-15 00:10:57,496 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:57,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335344552] [2019-10-15 00:10:57,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:57,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:57,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:57,659 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:57,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335344552] [2019-10-15 00:10:57,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:57,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 00:10:57,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264400398] [2019-10-15 00:10:57,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:10:57,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:57,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:10:57,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:10:57,691 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2019-10-15 00:10:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:57,723 INFO L93 Difference]: Finished difference Result 174 states and 284 transitions. [2019-10-15 00:10:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:10:57,725 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-10-15 00:10:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:57,737 INFO L225 Difference]: With dead ends: 174 [2019-10-15 00:10:57,737 INFO L226 Difference]: Without dead ends: 84 [2019-10-15 00:10:57,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:10:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-15 00:10:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-10-15 00:10:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-15 00:10:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-10-15 00:10:57,833 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 9 [2019-10-15 00:10:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:57,834 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-10-15 00:10:57,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:10:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-10-15 00:10:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 00:10:57,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:57,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:10:57,838 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:57,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:57,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1385985618, now seen corresponding path program 1 times [2019-10-15 00:10:57,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:57,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589996911] [2019-10-15 00:10:57,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:57,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:57,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:57,957 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:57,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589996911] [2019-10-15 00:10:57,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:57,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:10:57,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245737376] [2019-10-15 00:10:57,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:10:57,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:57,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:10:57,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:10:57,961 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 3 states. [2019-10-15 00:10:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:58,000 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-10-15 00:10:58,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:10:58,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-15 00:10:58,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:58,003 INFO L225 Difference]: With dead ends: 84 [2019-10-15 00:10:58,003 INFO L226 Difference]: Without dead ends: 74 [2019-10-15 00:10:58,004 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:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-15 00:10:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-15 00:10:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-15 00:10:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2019-10-15 00:10:58,013 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2019-10-15 00:10:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:58,013 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2019-10-15 00:10:58,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:10:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2019-10-15 00:10:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 00:10:58,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:58,014 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:10:58,015 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:58,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1923530661, now seen corresponding path program 1 times [2019-10-15 00:10:58,016 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:58,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76442194] [2019-10-15 00:10:58,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:58,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:58,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:58,101 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:58,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76442194] [2019-10-15 00:10:58,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:58,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:10:58,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561035717] [2019-10-15 00:10:58,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:10:58,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:10:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:10:58,105 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 4 states. [2019-10-15 00:10:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:58,185 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2019-10-15 00:10:58,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:10:58,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 00:10:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:58,188 INFO L225 Difference]: With dead ends: 74 [2019-10-15 00:10:58,188 INFO L226 Difference]: Without dead ends: 72 [2019-10-15 00:10:58,189 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:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-15 00:10:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-15 00:10:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-15 00:10:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-10-15 00:10:58,197 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 13 [2019-10-15 00:10:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:58,198 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-10-15 00:10:58,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:10:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-10-15 00:10:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 00:10:58,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:58,199 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 00:10:58,199 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:58,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:58,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1449483421, now seen corresponding path program 1 times [2019-10-15 00:10:58,200 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:58,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111112487] [2019-10-15 00:10:58,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:58,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:58,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:58,238 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:58,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111112487] [2019-10-15 00:10:58,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:58,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:10:58,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576492996] [2019-10-15 00:10:58,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:10:58,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:58,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:10:58,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:10:58,243 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2019-10-15 00:10:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:58,294 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2019-10-15 00:10:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:10:58,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-15 00:10:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:58,296 INFO L225 Difference]: With dead ends: 157 [2019-10-15 00:10:58,296 INFO L226 Difference]: Without dead ends: 91 [2019-10-15 00:10:58,297 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:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-15 00:10:58,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2019-10-15 00:10:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-15 00:10:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2019-10-15 00:10:58,309 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 16 [2019-10-15 00:10:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:58,309 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2019-10-15 00:10:58,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:10:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2019-10-15 00:10:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 00:10:58,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:58,311 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] [2019-10-15 00:10:58,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:58,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1095322203, now seen corresponding path program 1 times [2019-10-15 00:10:58,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:58,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578969794] [2019-10-15 00:10:58,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:58,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:58,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:58,380 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:58,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578969794] [2019-10-15 00:10:58,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:58,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:10:58,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500300050] [2019-10-15 00:10:58,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:10:58,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:58,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:10:58,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:10:58,382 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2019-10-15 00:10:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:58,402 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-10-15 00:10:58,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:10:58,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 00:10:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:58,405 INFO L225 Difference]: With dead ends: 83 [2019-10-15 00:10:58,405 INFO L226 Difference]: Without dead ends: 81 [2019-10-15 00:10:58,406 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:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-15 00:10:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-15 00:10:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-15 00:10:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2019-10-15 00:10:58,423 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 21 [2019-10-15 00:10:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:58,424 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2019-10-15 00:10:58,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:10:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2019-10-15 00:10:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 00:10:58,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:58,425 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] [2019-10-15 00:10:58,427 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:58,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:58,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1095324125, now seen corresponding path program 1 times [2019-10-15 00:10:58,428 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:58,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883761156] [2019-10-15 00:10:58,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:58,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:58,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:58,502 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:58,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883761156] [2019-10-15 00:10:58,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:10:58,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:10:58,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786277414] [2019-10-15 00:10:58,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:10:58,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:10:58,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:10:58,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:10:58,505 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 4 states. [2019-10-15 00:10:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:10:58,586 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2019-10-15 00:10:58,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 00:10:58,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 00:10:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:10:58,589 INFO L225 Difference]: With dead ends: 101 [2019-10-15 00:10:58,589 INFO L226 Difference]: Without dead ends: 76 [2019-10-15 00:10:58,590 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:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-15 00:10:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-15 00:10:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-15 00:10:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-10-15 00:10:58,602 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2019-10-15 00:10:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:10:58,603 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-10-15 00:10:58,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:10:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-10-15 00:10:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 00:10:58,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:10:58,606 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] [2019-10-15 00:10:58,606 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:10:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:10:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash -648846271, now seen corresponding path program 1 times [2019-10-15 00:10:58,607 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:10:58,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365815851] [2019-10-15 00:10:58,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:58,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:10:58,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:10:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:10:58,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365815851] [2019-10-15 00:10:58,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531082906] [2019-10-15 00:10:58,736 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:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:10:58,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-15 00:10:58,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:10:58,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-15 00:10:58,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:10:58,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:58,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:10:58,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-15 00:10:58,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:58,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-15 00:10:58,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:10:59,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:59,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 00:10:59,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:59,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 81 [2019-10-15 00:10:59,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 00:10:59,145 INFO L567 ElimStorePlain]: treesize reduction 48, result has 46.1 percent of original size [2019-10-15 00:10:59,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:10:59,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:31 [2019-10-15 00:10:59,249 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-10-15 00:10:59,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-10-15 00:10:59,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:10:59,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:10:59,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:10:59,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-15 00:10:59,296 INFO L567 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2019-10-15 00:10:59,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 00:10:59,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-10-15 00:10:59,367 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:59,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-10-15 00:10:59,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 00:10:59,382 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-10-15 00:10:59,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 00:10:59,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-10-15 00:10:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:10:59,396 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:10:59,417 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 00:10:59,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 00:10:59,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-15 00:10:59,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-10-15 00:10:59,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44017 treesize of output 43761 [2019-10-15 00:10:59,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-15 00:11:00,792 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 309 DAG size of output: 43 [2019-10-15 00:11:00,793 INFO L567 ElimStorePlain]: treesize reduction 43314, result has 0.2 percent of original size [2019-10-15 00:11:00,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:00,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:00,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:00,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:00,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:00,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:00,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:00,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:11:00,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-10-15 00:11:00,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:143, output treesize:77 [2019-10-15 00:11:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:11:00,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [720848916] [2019-10-15 00:11:00,897 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 24 [2019-10-15 00:11:00,941 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 00:11:00,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 00:11:01,021 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 00:11:01,023 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 19 root evaluator evaluations with a maximum evaluation depth of 0. Performed 19 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 32 variables. [2019-10-15 00:11:01,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:11:01,028 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 00:11:01,065 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-15 00:11:01,065 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 00:11:01,067 INFO L553 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-10-15 00:11:01,067 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 00:11:01,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 00:11:01,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 6, 6] total 10 [2019-10-15 00:11:01,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185617966] [2019-10-15 00:11:01,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 00:11:01,070 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 00:11:01,070 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 00:11:01,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 00:11:01,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:01,070 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 2 states. [2019-10-15 00:11:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:11:01,072 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-10-15 00:11:01,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 00:11:01,073 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-10-15 00:11:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:11:01,073 INFO L225 Difference]: With dead ends: 76 [2019-10-15 00:11:01,073 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 00:11:01,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 00:11:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 00:11:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 00:11:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 00:11:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 00:11:01,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-15 00:11:01,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:11:01,075 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 00:11:01,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 00:11:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 00:11:01,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 00:11:01,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:11:01,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 00:11:01,328 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:11:01,328 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:11:01,328 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:11:01,328 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 00:11:01,329 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 00:11:01,329 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 00:11:01,329 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 00:11:01,329 INFO L443 ceAbstractionStarter]: For program point L993-1(lines 993 1018) no Hoare annotation was computed. [2019-10-15 00:11:01,329 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 983 1057) no Hoare annotation was computed. [2019-10-15 00:11:01,329 INFO L443 ceAbstractionStarter]: For program point L1010(lines 1010 1014) no Hoare annotation was computed. [2019-10-15 00:11:01,329 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1016) no Hoare annotation was computed. [2019-10-15 00:11:01,329 INFO L443 ceAbstractionStarter]: For program point L1044-1(line 1044) no Hoare annotation was computed. [2019-10-15 00:11:01,330 INFO L443 ceAbstractionStarter]: For program point L1044-3(line 1044) no Hoare annotation was computed. [2019-10-15 00:11:01,330 INFO L443 ceAbstractionStarter]: For program point L1044-4(line 1044) no Hoare annotation was computed. [2019-10-15 00:11:01,330 INFO L443 ceAbstractionStarter]: For program point L1044-6(line 1044) no Hoare annotation was computed. [2019-10-15 00:11:01,330 INFO L439 ceAbstractionStarter]: At program point L1044-7(line 1044) the Hoare annotation is: (and (= main_~status~0 0) (not (= 0 main_~head~0.base))) [2019-10-15 00:11:01,330 INFO L443 ceAbstractionStarter]: For program point L1044-8(line 1044) no Hoare annotation was computed. [2019-10-15 00:11:01,330 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1028) no Hoare annotation was computed. [2019-10-15 00:11:01,330 INFO L443 ceAbstractionStarter]: For program point L1028-1(line 1028) no Hoare annotation was computed. [2019-10-15 00:11:01,331 INFO L443 ceAbstractionStarter]: For program point L1028-3(line 1028) no Hoare annotation was computed. [2019-10-15 00:11:01,331 INFO L439 ceAbstractionStarter]: At program point L1028-4(line 1028) the Hoare annotation is: false [2019-10-15 00:11:01,331 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 983 1057) no Hoare annotation was computed. [2019-10-15 00:11:01,331 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:01,331 INFO L443 ceAbstractionStarter]: For program point L1029(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:01,331 INFO L443 ceAbstractionStarter]: For program point L1029-1(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:01,331 INFO L443 ceAbstractionStarter]: For program point L1029-3(line 1029) no Hoare annotation was computed. [2019-10-15 00:11:01,331 INFO L443 ceAbstractionStarter]: For program point L1029-4(lines 1027 1031) no Hoare annotation was computed. [2019-10-15 00:11:01,332 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1037) no Hoare annotation was computed. [2019-10-15 00:11:01,332 INFO L443 ceAbstractionStarter]: For program point L1030(line 1030) no Hoare annotation was computed. [2019-10-15 00:11:01,332 INFO L443 ceAbstractionStarter]: For program point L1030-1(line 1030) no Hoare annotation was computed. [2019-10-15 00:11:01,332 INFO L443 ceAbstractionStarter]: For program point L1030-3(line 1030) no Hoare annotation was computed. [2019-10-15 00:11:01,332 INFO L443 ceAbstractionStarter]: For program point L1030-4(lines 1027 1031) no Hoare annotation was computed. [2019-10-15 00:11:01,332 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1038) no Hoare annotation was computed. [2019-10-15 00:11:01,332 INFO L443 ceAbstractionStarter]: For program point L1032(lines 1032 1039) no Hoare annotation was computed. [2019-10-15 00:11:01,333 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1017) no Hoare annotation was computed. [2019-10-15 00:11:01,333 INFO L443 ceAbstractionStarter]: For program point L1016(line 1016) no Hoare annotation was computed. [2019-10-15 00:11:01,333 INFO L443 ceAbstractionStarter]: For program point L1049-1(lines 984 1057) no Hoare annotation was computed. [2019-10-15 00:11:01,333 INFO L443 ceAbstractionStarter]: For program point L1049-2(lines 1049 1054) no Hoare annotation was computed. [2019-10-15 00:11:01,333 INFO L443 ceAbstractionStarter]: For program point L1016-2(line 1016) no Hoare annotation was computed. [2019-10-15 00:11:01,333 INFO L443 ceAbstractionStarter]: For program point L1016-3(lines 994 1018) no Hoare annotation was computed. [2019-10-15 00:11:01,333 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1014) no Hoare annotation was computed. [2019-10-15 00:11:01,334 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1020) no Hoare annotation was computed. [2019-10-15 00:11:01,334 INFO L443 ceAbstractionStarter]: For program point L1017(line 1017) no Hoare annotation was computed. [2019-10-15 00:11:01,334 INFO L443 ceAbstractionStarter]: For program point L1017-2(line 1017) no Hoare annotation was computed. [2019-10-15 00:11:01,334 INFO L443 ceAbstractionStarter]: For program point L1017-3(lines 994 1018) no Hoare annotation was computed. [2019-10-15 00:11:01,334 INFO L439 ceAbstractionStarter]: At program point L1017-4(lines 993 1018) the Hoare annotation is: false [2019-10-15 00:11:01,334 INFO L443 ceAbstractionStarter]: For program point L1034-1(line 1034) no Hoare annotation was computed. [2019-10-15 00:11:01,334 INFO L443 ceAbstractionStarter]: For program point L1034-3(line 1034) no Hoare annotation was computed. [2019-10-15 00:11:01,335 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1030) no Hoare annotation was computed. [2019-10-15 00:11:01,335 INFO L439 ceAbstractionStarter]: At program point L1034-4(line 1034) the Hoare annotation is: false [2019-10-15 00:11:01,335 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1034) no Hoare annotation was computed. [2019-10-15 00:11:01,335 INFO L443 ceAbstractionStarter]: For program point L1035(line 1035) no Hoare annotation was computed. [2019-10-15 00:11:01,335 INFO L443 ceAbstractionStarter]: For program point L1035-1(line 1035) no Hoare annotation was computed. [2019-10-15 00:11:01,335 INFO L443 ceAbstractionStarter]: For program point L1035-3(line 1035) no Hoare annotation was computed. [2019-10-15 00:11:01,335 INFO L443 ceAbstractionStarter]: For program point L1035-4(lines 1033 1039) no Hoare annotation was computed. [2019-10-15 00:11:01,336 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1044) no Hoare annotation was computed. [2019-10-15 00:11:01,336 INFO L443 ceAbstractionStarter]: For program point L1036(line 1036) no Hoare annotation was computed. [2019-10-15 00:11:01,336 INFO L443 ceAbstractionStarter]: For program point L1036-1(line 1036) no Hoare annotation was computed. [2019-10-15 00:11:01,336 INFO L443 ceAbstractionStarter]: For program point L1036-3(line 1036) no Hoare annotation was computed. [2019-10-15 00:11:01,336 INFO L443 ceAbstractionStarter]: For program point L1036-4(lines 1033 1039) no Hoare annotation was computed. [2019-10-15 00:11:01,336 INFO L443 ceAbstractionStarter]: For program point L1020(line 1020) no Hoare annotation was computed. [2019-10-15 00:11:01,336 INFO L443 ceAbstractionStarter]: For program point L1020-2(line 1020) no Hoare annotation was computed. [2019-10-15 00:11:01,337 INFO L443 ceAbstractionStarter]: For program point L1020-3(lines 984 1057) no Hoare annotation was computed. [2019-10-15 00:11:01,337 INFO L443 ceAbstractionStarter]: For program point L1020-4(lines 984 1057) no Hoare annotation was computed. [2019-10-15 00:11:01,337 INFO L443 ceAbstractionStarter]: For program point L1037(line 1037) no Hoare annotation was computed. [2019-10-15 00:11:01,337 INFO L443 ceAbstractionStarter]: For program point L1037-1(line 1037) no Hoare annotation was computed. [2019-10-15 00:11:01,337 INFO L443 ceAbstractionStarter]: For program point L1037-3(line 1037) no Hoare annotation was computed. [2019-10-15 00:11:01,337 INFO L443 ceAbstractionStarter]: For program point L1037-4(lines 1033 1039) no Hoare annotation was computed. [2019-10-15 00:11:01,337 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 983 1057) the Hoare annotation is: true [2019-10-15 00:11:01,337 INFO L443 ceAbstractionStarter]: For program point L1021(lines 984 1057) no Hoare annotation was computed. [2019-10-15 00:11:01,337 INFO L443 ceAbstractionStarter]: For program point L1038(line 1038) no Hoare annotation was computed. [2019-10-15 00:11:01,338 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1014) no Hoare annotation was computed. [2019-10-15 00:11:01,338 INFO L443 ceAbstractionStarter]: For program point L1038-1(line 1038) no Hoare annotation was computed. [2019-10-15 00:11:01,338 INFO L443 ceAbstractionStarter]: For program point L1038-3(line 1038) no Hoare annotation was computed. [2019-10-15 00:11:01,338 INFO L443 ceAbstractionStarter]: For program point L1038-4(lines 1033 1039) no Hoare annotation was computed. [2019-10-15 00:11:01,338 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1023) no Hoare annotation was computed. [2019-10-15 00:11:01,338 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:01,338 INFO L443 ceAbstractionStarter]: For program point L1023-1(line 1023) no Hoare annotation was computed. [2019-10-15 00:11:01,338 INFO L443 ceAbstractionStarter]: For program point L1023-3(line 1023) no Hoare annotation was computed. [2019-10-15 00:11:01,339 INFO L439 ceAbstractionStarter]: At program point L1023-4(line 1023) the Hoare annotation is: false [2019-10-15 00:11:01,339 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1035) no Hoare annotation was computed. [2019-10-15 00:11:01,339 INFO L443 ceAbstractionStarter]: For program point L1024(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:01,339 INFO L443 ceAbstractionStarter]: For program point L1024-1(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:01,339 INFO L443 ceAbstractionStarter]: For program point L1024-3(line 1024) no Hoare annotation was computed. [2019-10-15 00:11:01,339 INFO L443 ceAbstractionStarter]: For program point L1024-4(lines 1022 1025) no Hoare annotation was computed. [2019-10-15 00:11:01,339 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1036) no Hoare annotation was computed. [2019-10-15 00:11:01,339 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-10-15 00:11:01,340 INFO L443 ceAbstractionStarter]: For program point L1042-3(lines 1042 1046) no Hoare annotation was computed. [2019-10-15 00:11:01,340 INFO L439 ceAbstractionStarter]: At program point L1042-5(lines 1042 1046) the Hoare annotation is: (and (= main_~status~0 0) (not (= 0 main_~head~0.base))) [2019-10-15 00:11:01,340 INFO L443 ceAbstractionStarter]: For program point L1026(lines 984 1057) no Hoare annotation was computed. [2019-10-15 00:11:01,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:11:01 BoogieIcfgContainer [2019-10-15 00:11:01,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 00:11:01,356 INFO L168 Benchmark]: Toolchain (without parser) took 5543.88 ms. Allocated memory was 141.6 MB in the beginning and 245.9 MB in the end (delta: 104.3 MB). Free memory was 102.1 MB in the beginning and 93.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:01,357 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 141.6 MB. Free memory is still 122.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 00:11:01,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.04 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 102.1 MB in the beginning and 170.4 MB in the end (delta: -68.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:01,358 INFO L168 Benchmark]: Boogie Preprocessor took 75.29 ms. Allocated memory is still 203.9 MB. Free memory was 170.4 MB in the beginning and 167.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:01,359 INFO L168 Benchmark]: RCFGBuilder took 791.15 ms. Allocated memory is still 203.9 MB. Free memory was 167.5 MB in the beginning and 112.7 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:01,360 INFO L168 Benchmark]: TraceAbstraction took 3973.77 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 111.7 MB in the beginning and 93.5 MB in the end (delta: 18.2 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. [2019-10-15 00:11:01,363 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.25 ms. Allocated memory is still 141.6 MB. Free memory is still 122.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 699.04 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 102.1 MB in the beginning and 170.4 MB in the end (delta: -68.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.29 ms. Allocated memory is still 203.9 MB. Free memory was 170.4 MB in the beginning and 167.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.15 ms. Allocated memory is still 203.9 MB. Free memory was 167.5 MB in the beginning and 112.7 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3973.77 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 111.7 MB in the beginning and 93.5 MB in the end (delta: 18.2 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1044]: 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: 1028]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1038]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1024]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1034]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1030]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1020]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1035]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1036]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1023]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1017]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1016]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: status == 0 && !(0 == head) - InvariantResult [Line: 1042]: Loop Invariant Derived loop invariant: status == 0 && !(0 == head) - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 90 locations, 14 error locations. Result: SAFE, OverallTime: 3.8s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 481 SDtfs, 217 SDslu, 313 SDs, 0 SdLazy, 79 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=0, 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, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 12 NumberOfFragments, 24 HoareAnnotationTreeSize, 10 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 150 ConstructedInterpolants, 15 QuantifiedInterpolants, 18699 SizeOfPredicates, 10 NumberOfNonLiveVariables, 104 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 132, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9204545454545454, AVG_VARS_REMOVED_DURING_WEAKENING: 0.7727272727272727, AVG_WEAKENED_CONJUNCTS: 0.2727272727272727, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...