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/array-examples/relax-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:51:56,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:51:56,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:51:56,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:51:56,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:51:56,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:51:56,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:51:56,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:51:56,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:51:56,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:51:56,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:51:56,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:51:56,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:51:56,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:51:56,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:51:56,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:51:56,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:51:56,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:51:56,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:51:56,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:51:56,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:51:56,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:51:56,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:51:56,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:51:56,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:51:56,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:51:56,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:51:56,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:51:56,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:51:56,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:51:56,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:51:56,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:51:56,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:51:56,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:51:56,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:51:56,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:51:56,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:51:56,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:51:56,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:51:56,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:51:56,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:51:56,576 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-14 23:51:56,610 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:51:56,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:51:56,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:51:56,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:51:56,612 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:51:56,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:51:56,616 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:51:56,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:51:56,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:51:56,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:51:56,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:51:56,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:51:56,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:51:56,617 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:51:56,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:51:56,617 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:51:56,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:51:56,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:51:56,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:51:56,618 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:51:56,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:51:56,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:51:56,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:51:56,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:51:56,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:51:56,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:51:56,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:51:56,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:51:56,621 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-14 23:51:56,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:51:56,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:51:56,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:51:56,896 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:51:56,897 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:51:56,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/relax-2.i [2019-10-14 23:51:56,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ee8f423/edf6f604d48647dfae50b30c976bff34/FLAGd71c03075 [2019-10-14 23:51:57,508 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:51:57,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/relax-2.i [2019-10-14 23:51:57,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ee8f423/edf6f604d48647dfae50b30c976bff34/FLAGd71c03075 [2019-10-14 23:51:57,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ee8f423/edf6f604d48647dfae50b30c976bff34 [2019-10-14 23:51:57,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:51:57,862 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:51:57,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:51:57,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:51:57,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:51:57,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:51:57" (1/1) ... [2019-10-14 23:51:57,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a029f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:57, skipping insertion in model container [2019-10-14 23:51:57,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:51:57" (1/1) ... [2019-10-14 23:51:57,877 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:51:57,935 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:51:58,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:51:58,398 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:51:58,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:51:58,504 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:51:58,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:58 WrapperNode [2019-10-14 23:51:58,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:51:58,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:51:58,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:51:58,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:51:58,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:58" (1/1) ... [2019-10-14 23:51:58,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:58" (1/1) ... [2019-10-14 23:51:58,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:58" (1/1) ... [2019-10-14 23:51:58,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:58" (1/1) ... [2019-10-14 23:51:58,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:58" (1/1) ... [2019-10-14 23:51:58,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:58" (1/1) ... [2019-10-14 23:51:58,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:58" (1/1) ... [2019-10-14 23:51:58,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:51:58,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:51:58,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:51:58,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:51:58,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:58" (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-14 23:51:58,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:51:58,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:51:58,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:51:58,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:51:58,650 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:51:58,650 INFO L138 BoogieDeclarations]: Found implementation of procedure is_relaxed_prefix [2019-10-14 23:51:58,650 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:51:58,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-14 23:51:58,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:51:58,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:51:58,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:51:58,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:51:58,651 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:51:58,651 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:51:58,651 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:51:58,652 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:51:58,652 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:51:58,652 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:51:58,652 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:51:58,652 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:51:58,652 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:51:58,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:51:58,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:51:58,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:51:58,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:51:58,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:51:58,653 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:51:58,654 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:51:58,654 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:51:58,654 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:51:58,654 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:51:58,654 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:51:58,654 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:51:58,654 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:51:58,655 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:51:58,655 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:51:58,655 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:51:58,655 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:51:58,655 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:51:58,656 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:51:58,656 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:51:58,656 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:51:58,656 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:51:58,656 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:51:58,656 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:51:58,656 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:51:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:51:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:51:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:51:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:51:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:51:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:51:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:51:58,658 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:51:58,658 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:51:58,658 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:51:58,658 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:51:58,658 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:51:58,658 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:51:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:51:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:51:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:51:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:51:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:51:58,659 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:51:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:51:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:51:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:51:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:51:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:51:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:51:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:51:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:51:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:51:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:51:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:51:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:51:58,661 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:51:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:51:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:51:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:51:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:51:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:51:58,662 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:51:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:51:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:51:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:51:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:51:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:51:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:51:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:51:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:51:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:51:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:51:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:51:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:51:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:51:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:51:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:51:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:51:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:51:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:51:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:51:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:51:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:51:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:51:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:51:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:51:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:51:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:51:58,666 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:51:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:51:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:51:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:51:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure is_relaxed_prefix [2019-10-14 23:51:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:51:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:51:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:51:58,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:51:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:51:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:51:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:51:59,301 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:51:59,301 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-14 23:51:59,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:51:59 BoogieIcfgContainer [2019-10-14 23:51:59,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:51:59,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:51:59,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:51:59,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:51:59,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:51:57" (1/3) ... [2019-10-14 23:51:59,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37872e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:51:59, skipping insertion in model container [2019-10-14 23:51:59,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:58" (2/3) ... [2019-10-14 23:51:59,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37872e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:51:59, skipping insertion in model container [2019-10-14 23:51:59,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:51:59" (3/3) ... [2019-10-14 23:51:59,312 INFO L109 eAbstractionObserver]: Analyzing ICFG relax-2.i [2019-10-14 23:51:59,322 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:51:59,332 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:51:59,347 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:51:59,375 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:51:59,375 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:51:59,375 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:51:59,375 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:51:59,376 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:51:59,376 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:51:59,376 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:51:59,376 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:51:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-10-14 23:51:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:51:59,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:59,401 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:59,403 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1056215727, now seen corresponding path program 1 times [2019-10-14 23:51:59,417 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:59,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839360438] [2019-10-14 23:51:59,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:59,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:59,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:59,623 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-14 23:51:59,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839360438] [2019-10-14 23:51:59,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:59,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:51:59,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275127651] [2019-10-14 23:51:59,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:51:59,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:59,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:51:59,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:59,650 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 4 states. [2019-10-14 23:51:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:59,697 INFO L93 Difference]: Finished difference Result 95 states and 146 transitions. [2019-10-14 23:51:59,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:51:59,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-14 23:51:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:59,710 INFO L225 Difference]: With dead ends: 95 [2019-10-14 23:51:59,710 INFO L226 Difference]: Without dead ends: 48 [2019-10-14 23:51:59,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-14 23:51:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-14 23:51:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-14 23:51:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2019-10-14 23:51:59,760 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 19 [2019-10-14 23:51:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:59,761 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-10-14 23:51:59,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:51:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2019-10-14 23:51:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:51:59,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:59,763 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-14 23:51:59,763 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:59,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash -864018085, now seen corresponding path program 1 times [2019-10-14 23:51:59,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:59,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904372483] [2019-10-14 23:51:59,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:59,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:59,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:59,976 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-14 23:51:59,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904372483] [2019-10-14 23:51:59,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:59,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:51:59,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791437202] [2019-10-14 23:51:59,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:51:59,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:59,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:51:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:51:59,980 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand 6 states. [2019-10-14 23:52:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:00,150 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2019-10-14 23:52:00,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:52:00,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-14 23:52:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:00,154 INFO L225 Difference]: With dead ends: 88 [2019-10-14 23:52:00,154 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 23:52:00,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:52:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 23:52:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-10-14 23:52:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 23:52:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2019-10-14 23:52:00,176 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 21 [2019-10-14 23:52:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:00,177 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2019-10-14 23:52:00,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:52:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2019-10-14 23:52:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:52:00,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:00,180 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:00,181 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:00,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2053893332, now seen corresponding path program 1 times [2019-10-14 23:52:00,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:00,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602923303] [2019-10-14 23:52:00,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:00,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:00,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:00,360 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-14 23:52:00,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602923303] [2019-10-14 23:52:00,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:00,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:52:00,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041230209] [2019-10-14 23:52:00,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:52:00,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:00,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:52:00,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:52:00,363 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand 6 states. [2019-10-14 23:52:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:00,498 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-10-14 23:52:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:52:00,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-14 23:52:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:00,502 INFO L225 Difference]: With dead ends: 74 [2019-10-14 23:52:00,502 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 23:52:00,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:52:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 23:52:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-14 23:52:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 23:52:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2019-10-14 23:52:00,514 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 22 [2019-10-14 23:52:00,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:00,514 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-10-14 23:52:00,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:52:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2019-10-14 23:52:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:52:00,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:00,516 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:00,516 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1666437145, now seen corresponding path program 1 times [2019-10-14 23:52:00,516 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:00,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161069871] [2019-10-14 23:52:00,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:00,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:00,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:00,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161069871] [2019-10-14 23:52:00,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860053797] [2019-10-14 23:52:00,764 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-14 23:52:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:00,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 23:52:00,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:01,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:52:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:01,050 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:52:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:01,161 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:52:01,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 15 [2019-10-14 23:52:01,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41018775] [2019-10-14 23:52:01,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:52:01,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:52:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:52:01,163 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 10 states. [2019-10-14 23:52:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:01,353 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2019-10-14 23:52:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:52:01,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-10-14 23:52:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:01,355 INFO L225 Difference]: With dead ends: 71 [2019-10-14 23:52:01,355 INFO L226 Difference]: Without dead ends: 69 [2019-10-14 23:52:01,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:52:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-14 23:52:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-10-14 23:52:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 23:52:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2019-10-14 23:52:01,365 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 23 [2019-10-14 23:52:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:01,366 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2019-10-14 23:52:01,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:52:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2019-10-14 23:52:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:52:01,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:01,367 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:01,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:01,573 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1672526710, now seen corresponding path program 1 times [2019-10-14 23:52:01,574 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:01,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643405157] [2019-10-14 23:52:01,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:01,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:01,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:01,612 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-14 23:52:01,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643405157] [2019-10-14 23:52:01,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:01,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:52:01,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59357226] [2019-10-14 23:52:01,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:01,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:01,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:01,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:01,616 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand 4 states. [2019-10-14 23:52:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:01,631 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2019-10-14 23:52:01,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:52:01,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-14 23:52:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:01,633 INFO L225 Difference]: With dead ends: 77 [2019-10-14 23:52:01,633 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 23:52:01,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 23:52:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-10-14 23:52:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 23:52:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2019-10-14 23:52:01,640 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 24 [2019-10-14 23:52:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:01,640 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-10-14 23:52:01,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2019-10-14 23:52:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:52:01,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:01,642 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:01,642 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:01,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:01,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1108220204, now seen corresponding path program 1 times [2019-10-14 23:52:01,643 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:01,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098294937] [2019-10-14 23:52:01,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:01,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:01,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:01,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098294937] [2019-10-14 23:52:01,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:01,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:52:01,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339119648] [2019-10-14 23:52:01,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:52:01,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:52:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:52:01,839 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand 8 states. [2019-10-14 23:52:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:02,119 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2019-10-14 23:52:02,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:52:02,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-10-14 23:52:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:02,121 INFO L225 Difference]: With dead ends: 97 [2019-10-14 23:52:02,121 INFO L226 Difference]: Without dead ends: 80 [2019-10-14 23:52:02,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:52:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-14 23:52:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2019-10-14 23:52:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 23:52:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2019-10-14 23:52:02,138 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 24 [2019-10-14 23:52:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:02,141 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2019-10-14 23:52:02,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:52:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2019-10-14 23:52:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:52:02,142 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:02,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:02,143 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash -351644855, now seen corresponding path program 1 times [2019-10-14 23:52:02,147 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:02,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719975758] [2019-10-14 23:52:02,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:02,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:02,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:02,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719975758] [2019-10-14 23:52:02,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:02,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:52:02,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772500664] [2019-10-14 23:52:02,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:52:02,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:02,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:52:02,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:02,195 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand 3 states. [2019-10-14 23:52:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:02,216 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2019-10-14 23:52:02,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:02,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:52:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:02,218 INFO L225 Difference]: With dead ends: 75 [2019-10-14 23:52:02,218 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 23:52:02,218 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-14 23:52:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 23:52:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-10-14 23:52:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:52:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2019-10-14 23:52:02,231 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 26 [2019-10-14 23:52:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:02,234 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2019-10-14 23:52:02,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:52:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2019-10-14 23:52:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:52:02,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:02,236 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:02,236 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1141713006, now seen corresponding path program 1 times [2019-10-14 23:52:02,240 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:02,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206286829] [2019-10-14 23:52:02,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:02,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:02,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:02,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206286829] [2019-10-14 23:52:02,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824698893] [2019-10-14 23:52:02,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:02,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-14 23:52:02,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:02,680 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:52:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:02,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:52:02,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 14 [2019-10-14 23:52:02,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981911346] [2019-10-14 23:52:02,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:52:02,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:52:02,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:52:02,831 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand 7 states. [2019-10-14 23:52:03,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:03,008 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2019-10-14 23:52:03,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:52:03,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-10-14 23:52:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:03,010 INFO L225 Difference]: With dead ends: 100 [2019-10-14 23:52:03,010 INFO L226 Difference]: Without dead ends: 64 [2019-10-14 23:52:03,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:52:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-14 23:52:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2019-10-14 23:52:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-14 23:52:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2019-10-14 23:52:03,025 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 30 [2019-10-14 23:52:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:03,025 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2019-10-14 23:52:03,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:52:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2019-10-14 23:52:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:52:03,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:03,027 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:03,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:03,232 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:03,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1929209556, now seen corresponding path program 1 times [2019-10-14 23:52:03,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:03,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12656018] [2019-10-14 23:52:03,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:03,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:03,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:03,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12656018] [2019-10-14 23:52:03,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309570180] [2019-10-14 23:52:03,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:03,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-14 23:52:03,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:03,505 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:52:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:03,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1895251845] [2019-10-14 23:52:03,684 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 33 [2019-10-14 23:52:03,721 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:52:03,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:52:03,779 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:52:03,780 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 17 root evaluator evaluations with a maximum evaluation depth of 0. Performed 17 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 34 variables. [2019-10-14 23:52:03,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:03,785 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:52:03,822 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-14 23:52:03,823 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:52:03,824 INFO L553 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2019-10-14 23:52:03,824 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:52:03,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:52:03,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 7, 10] total 15 [2019-10-14 23:52:03,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867525430] [2019-10-14 23:52:03,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:52:03,827 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:03,827 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:52:03,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:52:03,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:52:03,827 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 2 states. [2019-10-14 23:52:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:03,829 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2019-10-14 23:52:03,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:52:03,829 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-14 23:52:03,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:03,830 INFO L225 Difference]: With dead ends: 59 [2019-10-14 23:52:03,830 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:52:03,831 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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-14 23:52:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:52:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:52:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:52:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:52:03,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-10-14 23:52:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:03,832 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:52:03,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:52:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:52:03,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:52:04,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:04,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:52:04,198 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-10-14 23:52:04,304 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-10-14 23:52:04,435 INFO L443 ceAbstractionStarter]: For program point is_relaxed_prefixEXIT(lines 1088 1112) no Hoare annotation was computed. [2019-10-14 23:52:04,435 INFO L443 ceAbstractionStarter]: For program point L1101(lines 1101 1104) no Hoare annotation was computed. [2019-10-14 23:52:04,435 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1105) no Hoare annotation was computed. [2019-10-14 23:52:04,435 INFO L443 ceAbstractionStarter]: For program point L1097-2(lines 1097 1106) no Hoare annotation was computed. [2019-10-14 23:52:04,436 INFO L439 ceAbstractionStarter]: At program point L1097-3(lines 1097 1106) the Hoare annotation is: (and (let ((.cse0 (<= (mod |is_relaxed_prefix_#in~pat_length| 4294967296) (mod (+ |is_relaxed_prefix_#in~a_length| 1) 4294967296))) (.cse1 (= |is_relaxed_prefix_#in~a_length| is_relaxed_prefix_~a_length))) (or (and (< 0 (mod |is_relaxed_prefix_#in~a_length| 4294967296)) .cse0 .cse1) (and .cse0 (= 0 is_relaxed_prefix_~shift~0) .cse1))) (= |is_relaxed_prefix_#in~pat_length| is_relaxed_prefix_~pat_length)) [2019-10-14 23:52:04,436 INFO L443 ceAbstractionStarter]: For program point L1097-4(lines 1091 1112) no Hoare annotation was computed. [2019-10-14 23:52:04,436 INFO L446 ceAbstractionStarter]: At program point is_relaxed_prefixENTRY(lines 1088 1112) the Hoare annotation is: true [2019-10-14 23:52:04,436 INFO L443 ceAbstractionStarter]: For program point is_relaxed_prefixFINAL(lines 1088 1112) no Hoare annotation was computed. [2019-10-14 23:52:04,436 INFO L443 ceAbstractionStarter]: For program point L1092(lines 1092 1093) no Hoare annotation was computed. [2019-10-14 23:52:04,437 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:52:04,437 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:52:04,437 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:52:04,437 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 145 149) no Hoare annotation was computed. [2019-10-14 23:52:04,437 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 145 149) no Hoare annotation was computed. [2019-10-14 23:52:04,437 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 145 149) no Hoare annotation was computed. [2019-10-14 23:52:04,437 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 150 154) no Hoare annotation was computed. [2019-10-14 23:52:04,437 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 150 154) no Hoare annotation was computed. [2019-10-14 23:52:04,437 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 150 154) no Hoare annotation was computed. [2019-10-14 23:52:04,438 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:52:04,438 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:52:04,438 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:52:04,438 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:52:04,438 INFO L443 ceAbstractionStarter]: For program point L1150-2(lines 1150 1154) no Hoare annotation was computed. [2019-10-14 23:52:04,438 INFO L439 ceAbstractionStarter]: At program point L1150-3(lines 1150 1154) the Hoare annotation is: false [2019-10-14 23:52:04,438 INFO L443 ceAbstractionStarter]: For program point L1150-4(lines 1148 1158) no Hoare annotation was computed. [2019-10-14 23:52:04,438 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1114 1161) no Hoare annotation was computed. [2019-10-14 23:52:04,439 INFO L443 ceAbstractionStarter]: For program point L1126-2(lines 1126 1128) no Hoare annotation was computed. [2019-10-14 23:52:04,439 INFO L439 ceAbstractionStarter]: At program point L1126-3(lines 1126 1128) the Hoare annotation is: (and (= main_~j~0 0) (<= (div (+ main_~pat_len~0 (* (div main_~pat_len~0 4294967296) (- 4294967296)) 4294967295) 4294967296) 0)) [2019-10-14 23:52:04,439 INFO L439 ceAbstractionStarter]: At program point L1126-4(lines 1126 1128) the Hoare annotation is: (let ((.cse0 (div main_~pat_len~0 4294967296))) (or (and (= main_~j~0 0) (<= (div (+ main_~pat_len~0 (* .cse0 (- 4294967296)) 4294967295) 4294967296) 0)) (and (forall ((main_~a_len~0 Int)) (or (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296)) (<= main_~a_len~0 (let ((.cse1 (div main_~a_len~0 4294967296))) (+ (* 4294967296 (div (+ main_~a_len~0 (* .cse1 (- 4294967296))) 4294967296)) (* 4294967296 .cse1)))))) (<= (+ (* 4294967296 .cse0) 1) main_~pat_len~0) (<= main_~a_len~0 (let ((.cse2 (div main_~a_len~0 4294967296))) (+ (* 4294967296 (div (+ main_~a_len~0 (* .cse2 (- 4294967296))) 4294967296)) (* 4294967296 .cse2))))))) [2019-10-14 23:52:04,439 INFO L439 ceAbstractionStarter]: At program point L1155-1(lines 1155 1156) the Hoare annotation is: false [2019-10-14 23:52:04,439 INFO L443 ceAbstractionStarter]: For program point L1147(lines 1147 1158) no Hoare annotation was computed. [2019-10-14 23:52:04,439 INFO L443 ceAbstractionStarter]: For program point L1147-1(lines 1131 1158) no Hoare annotation was computed. [2019-10-14 23:52:04,439 INFO L443 ceAbstractionStarter]: For program point L1143(lines 1143 1144) no Hoare annotation was computed. [2019-10-14 23:52:04,440 INFO L443 ceAbstractionStarter]: For program point L1143-2(lines 1139 1144) no Hoare annotation was computed. [2019-10-14 23:52:04,440 INFO L443 ceAbstractionStarter]: For program point L1139(lines 1139 1144) no Hoare annotation was computed. [2019-10-14 23:52:04,440 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1136) no Hoare annotation was computed. [2019-10-14 23:52:04,440 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1136) no Hoare annotation was computed. [2019-10-14 23:52:04,440 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1158) no Hoare annotation was computed. [2019-10-14 23:52:04,440 INFO L443 ceAbstractionStarter]: For program point L1123-2(lines 1123 1125) no Hoare annotation was computed. [2019-10-14 23:52:04,440 INFO L439 ceAbstractionStarter]: At program point L1123-3(lines 1123 1125) the Hoare annotation is: false [2019-10-14 23:52:04,440 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1153) no Hoare annotation was computed. [2019-10-14 23:52:04,441 INFO L443 ceAbstractionStarter]: For program point L1123-4(lines 1123 1125) no Hoare annotation was computed. [2019-10-14 23:52:04,441 INFO L439 ceAbstractionStarter]: At program point L1144(line 1144) the Hoare annotation is: false [2019-10-14 23:52:04,441 INFO L443 ceAbstractionStarter]: For program point L1144-1(line 1144) no Hoare annotation was computed. [2019-10-14 23:52:04,441 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 1114 1161) no Hoare annotation was computed. [2019-10-14 23:52:04,441 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 1114 1161) the Hoare annotation is: true [2019-10-14 23:52:04,441 INFO L443 ceAbstractionStarter]: For program point L1141(lines 1141 1144) no Hoare annotation was computed. [2019-10-14 23:52:04,441 INFO L439 ceAbstractionStarter]: At program point L1137-2(lines 1137 1145) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~pat_len~0 4294967296)))) (or (and (<= main_~pat_len~0 .cse0) (= main_~j~0 0)) (and (forall ((main_~a_len~0 Int)) (or (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296)) (<= main_~a_len~0 (let ((.cse1 (div main_~a_len~0 4294967296))) (+ (* 4294967296 (div (+ main_~a_len~0 (* .cse1 (- 4294967296))) 4294967296)) (* 4294967296 .cse1)))))) (and (<= (+ .cse0 1) main_~pat_len~0) (<= (mod main_~pat_len~0 4294967296) (mod (+ main_~a_len~0 1) 4294967296))) (<= main_~a_len~0 (let ((.cse2 (div main_~a_len~0 4294967296))) (+ (* 4294967296 (div (+ main_~a_len~0 (* .cse2 (- 4294967296))) 4294967296)) (* 4294967296 .cse2))))))) [2019-10-14 23:52:04,442 INFO L439 ceAbstractionStarter]: At program point L1133(line 1133) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~pat_len~0 4294967296)))) (or (and (forall ((main_~a_len~0 Int)) (or (< (mod main_~j~1 4294967296) (mod main_~a_len~0 4294967296)) (<= main_~a_len~0 (let ((.cse0 (div main_~a_len~0 4294967296))) (+ (* 4294967296 (div (+ main_~a_len~0 (* .cse0 (- 4294967296))) 4294967296)) (* 4294967296 .cse0)))))) (<= (+ .cse1 1) main_~pat_len~0) (<= (mod main_~pat_len~0 4294967296) (mod (+ main_~a_len~0 1) 4294967296)) (<= main_~a_len~0 (let ((.cse2 (div main_~a_len~0 4294967296))) (+ (* 4294967296 (div (+ main_~a_len~0 (* .cse2 (- 4294967296))) 4294967296)) (* 4294967296 .cse2))))) (and (<= main_~pat_len~0 .cse1) (= main_~j~0 0)))) [2019-10-14 23:52:04,442 INFO L443 ceAbstractionStarter]: For program point L1133-1(line 1133) no Hoare annotation was computed. [2019-10-14 23:52:04,442 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-10-14 23:52:04,442 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2019-10-14 23:52:04,442 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2019-10-14 23:52:04,442 INFO L443 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2019-10-14 23:52:04,442 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 9) no Hoare annotation was computed. [2019-10-14 23:52:04,443 INFO L443 ceAbstractionStarter]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2019-10-14 23:52:04,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,452 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:52:04 BoogieIcfgContainer [2019-10-14 23:52:04,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:52:04,463 INFO L168 Benchmark]: Toolchain (without parser) took 6600.78 ms. Allocated memory was 138.4 MB in the beginning and 281.5 MB in the end (delta: 143.1 MB). Free memory was 101.7 MB in the beginning and 196.4 MB in the end (delta: -94.7 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:04,463 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:52:04,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.75 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 168.1 MB in the end (delta: -66.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:04,465 INFO L168 Benchmark]: Boogie Preprocessor took 82.37 ms. Allocated memory is still 202.4 MB. Free memory was 168.1 MB in the beginning and 165.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:04,466 INFO L168 Benchmark]: RCFGBuilder took 712.71 ms. Allocated memory is still 202.4 MB. Free memory was 165.5 MB in the beginning and 118.3 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:04,467 INFO L168 Benchmark]: TraceAbstraction took 5156.06 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 117.7 MB in the beginning and 196.4 MB in the end (delta: -78.7 MB). Peak memory consumption was 452.8 kB. Max. memory is 7.1 GB. [2019-10-14 23:52:04,470 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 641.75 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 168.1 MB in the end (delta: -66.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.37 ms. Allocated memory is still 202.4 MB. Free memory was 168.1 MB in the beginning and 165.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 712.71 ms. Allocated memory is still 202.4 MB. Free memory was 165.5 MB in the beginning and 118.3 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5156.06 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 117.7 MB in the beginning and 196.4 MB in the end (delta: -78.7 MB). Peak memory consumption was 452.8 kB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1123]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1137]: Loop Invariant [2019-10-14 23:52:04,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,486 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] [2019-10-14 23:52:04,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~a_len~0,QUANTIFIED] Derived loop invariant: (pat_len <= 4294967296 * (pat_len / 4294967296) && j == 0) || (((forall main_~a_len~0 : int :: j % 4294967296 < main_~a_len~0 % 4294967296 || main_~a_len~0 <= 4294967296 * ((main_~a_len~0 + main_~a_len~0 / 4294967296 * -4294967296) / 4294967296) + 4294967296 * (main_~a_len~0 / 4294967296)) && 4294967296 * (pat_len / 4294967296) + 1 <= pat_len && pat_len % 4294967296 <= (a_len + 1) % 4294967296) && a_len <= 4294967296 * ((a_len + a_len / 4294967296 * -4294967296) / 4294967296) + 4294967296 * (a_len / 4294967296)) - InvariantResult [Line: 1126]: Loop Invariant Derived loop invariant: j == 0 && (pat_len + pat_len / 4294967296 * -4294967296 + 4294967295) / 4294967296 <= 0 - InvariantResult [Line: 1097]: Loop Invariant Derived loop invariant: (((0 < \old(a_length) % 4294967296 && \old(pat_length) % 4294967296 <= (\old(a_length) + 1) % 4294967296) && \old(a_length) == a_length) || ((\old(pat_length) % 4294967296 <= (\old(a_length) + 1) % 4294967296 && 0 == shift) && \old(a_length) == a_length)) && \old(pat_length) == pat_length - InvariantResult [Line: 1150]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 56 locations, 1 error locations. Result: SAFE, OverallTime: 5.0s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 439 SDtfs, 286 SDslu, 1206 SDs, 0 SdLazy, 450 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 136 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=4, 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, 9 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 37 PreInvPairs, 48 NumberOfFragments, 296 HoareAnnotationTreeSize, 37 FomulaSimplifications, 254 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 97 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 376 ConstructedInterpolants, 11 QuantifiedInterpolants, 46751 SizeOfPredicates, 22 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 12/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 101, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9112903225806451, AVG_VARS_REMOVED_DURING_WEAKENING: 1.2903225806451613, AVG_WEAKENED_CONJUNCTS: 0.1935483870967742, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...