/usr/bin/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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/list-properties/list-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 03:54:48,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 03:54:48,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 03:54:48,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 03:54:48,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 03:54:48,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 03:54:48,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 03:54:48,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 03:54:48,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 03:54:48,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 03:54:48,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 03:54:48,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 03:54:48,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 03:54:48,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 03:54:48,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 03:54:48,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 03:54:48,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 03:54:48,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 03:54:48,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 03:54:48,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 03:54:48,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 03:54:48,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 03:54:48,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 03:54:48,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 03:54:48,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 03:54:48,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 03:54:48,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 03:54:48,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 03:54:48,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 03:54:48,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 03:54:48,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 03:54:48,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 03:54:48,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 03:54:48,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 03:54:48,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 03:54:48,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 03:54:48,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 03:54:48,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 03:54:48,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 03:54:48,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 03:54:48,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 03:54:48,635 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-11-07 03:54:48,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 03:54:48,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 03:54:48,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 03:54:48,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 03:54:48,651 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 03:54:48,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 03:54:48,651 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 03:54:48,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 03:54:48,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 03:54:48,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 03:54:48,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 03:54:48,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 03:54:48,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 03:54:48,652 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 03:54:48,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 03:54:48,653 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 03:54:48,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 03:54:48,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 03:54:48,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 03:54:48,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 03:54:48,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 03:54:48,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 03:54:48,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 03:54:48,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 03:54:48,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 03:54:48,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 03:54:48,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 03:54:48,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 03:54:48,656 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 03:54:48,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 03:54:48,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 03:54:48,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 03:54:48,971 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 03:54:48,972 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 03:54:48,972 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list-1.i [2019-11-07 03:54:49,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/344da12a2/0e6b5f6d45f249cf98cf12d96ad762ac/FLAG335f66daf [2019-11-07 03:54:49,606 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 03:54:49,606 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list-1.i [2019-11-07 03:54:49,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/344da12a2/0e6b5f6d45f249cf98cf12d96ad762ac/FLAG335f66daf [2019-11-07 03:54:49,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/344da12a2/0e6b5f6d45f249cf98cf12d96ad762ac [2019-11-07 03:54:49,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 03:54:49,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 03:54:49,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 03:54:49,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 03:54:49,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 03:54:49,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:54:49" (1/1) ... [2019-11-07 03:54:49,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d88b7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:49, skipping insertion in model container [2019-11-07 03:54:49,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:54:49" (1/1) ... [2019-11-07 03:54:49,898 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 03:54:49,942 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 03:54:50,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:54:50,434 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 03:54:50,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:54:50,536 INFO L192 MainTranslator]: Completed translation [2019-11-07 03:54:50,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:50 WrapperNode [2019-11-07 03:54:50,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 03:54:50,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 03:54:50,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 03:54:50,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 03:54:50,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:50" (1/1) ... [2019-11-07 03:54:50,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:50" (1/1) ... [2019-11-07 03:54:50,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:50" (1/1) ... [2019-11-07 03:54:50,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:50" (1/1) ... [2019-11-07 03:54:50,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:50" (1/1) ... [2019-11-07 03:54:50,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:50" (1/1) ... [2019-11-07 03:54:50,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:50" (1/1) ... [2019-11-07 03:54:50,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 03:54:50,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 03:54:50,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 03:54:50,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 03:54:50,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 03:54:50,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 03:54:50,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 03:54:50,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-07 03:54:50,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-07 03:54:50,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-07 03:54:50,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-07 03:54:50,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-07 03:54:50,664 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-07 03:54:50,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 03:54:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 03:54:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 03:54:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-07 03:54:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-07 03:54:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-07 03:54:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-07 03:54:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-07 03:54:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-07 03:54:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-07 03:54:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-07 03:54:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-07 03:54:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-07 03:54:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-07 03:54:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-07 03:54:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-07 03:54:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-07 03:54:50,673 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-07 03:54:50,673 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-07 03:54:50,674 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-07 03:54:50,674 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-07 03:54:50,674 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-07 03:54:50,674 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-07 03:54:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-07 03:54:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-07 03:54:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-07 03:54:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-07 03:54:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-07 03:54:50,675 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-07 03:54:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-07 03:54:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-07 03:54:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-07 03:54:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-07 03:54:50,676 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-07 03:54:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-07 03:54:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-07 03:54:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-07 03:54:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-07 03:54:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-07 03:54:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-07 03:54:50,677 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-07 03:54:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-07 03:54:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-07 03:54:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-07 03:54:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-07 03:54:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-07 03:54:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-07 03:54:50,678 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-07 03:54:50,679 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-07 03:54:50,679 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-07 03:54:50,679 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-07 03:54:50,679 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-07 03:54:50,680 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-07 03:54:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-07 03:54:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-07 03:54:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-07 03:54:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-07 03:54:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-07 03:54:50,681 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 03:54:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-07 03:54:50,682 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-07 03:54:50,683 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 03:54:50,683 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-07 03:54:50,683 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-07 03:54:50,683 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-07 03:54:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-07 03:54:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-07 03:54:50,684 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-07 03:54:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-07 03:54:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-07 03:54:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 03:54:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-07 03:54:50,685 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-07 03:54:50,686 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-07 03:54:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-07 03:54:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-07 03:54:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-07 03:54:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-07 03:54:50,687 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-07 03:54:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-07 03:54:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-07 03:54:50,688 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-07 03:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-07 03:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-07 03:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-07 03:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-07 03:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-07 03:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-07 03:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-07 03:54:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-07 03:54:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-07 03:54:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-07 03:54:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-07 03:54:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-07 03:54:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-07 03:54:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-07 03:54:50,691 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-07 03:54:50,691 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-07 03:54:50,691 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-07 03:54:50,691 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-07 03:54:50,691 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-07 03:54:50,691 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-07 03:54:50,691 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-07 03:54:50,692 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-07 03:54:50,692 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-07 03:54:50,692 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-07 03:54:50,692 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-07 03:54:50,692 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-07 03:54:50,692 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-07 03:54:50,692 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-07 03:54:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-07 03:54:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 03:54:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 03:54:50,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 03:54:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 03:54:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 03:54:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 03:54:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 03:54:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 03:54:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 03:54:51,106 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-07 03:54:51,307 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 03:54:51,307 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-07 03:54:51,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:51 BoogieIcfgContainer [2019-11-07 03:54:51,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 03:54:51,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 03:54:51,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 03:54:51,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 03:54:51,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:54:49" (1/3) ... [2019-11-07 03:54:51,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee819c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:54:51, skipping insertion in model container [2019-11-07 03:54:51,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:50" (2/3) ... [2019-11-07 03:54:51,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee819c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:54:51, skipping insertion in model container [2019-11-07 03:54:51,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:51" (3/3) ... [2019-11-07 03:54:51,317 INFO L109 eAbstractionObserver]: Analyzing ICFG list-1.i [2019-11-07 03:54:51,325 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 03:54:51,332 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 03:54:51,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 03:54:51,369 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 03:54:51,369 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 03:54:51,369 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 03:54:51,369 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 03:54:51,370 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 03:54:51,370 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 03:54:51,370 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 03:54:51,370 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 03:54:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-07 03:54:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 03:54:51,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:54:51,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:54:51,395 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:54:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:54:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 725742413, now seen corresponding path program 1 times [2019-11-07 03:54:51,411 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:54:51,411 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640971379] [2019-11-07 03:54:51,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:54:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:54:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:54:51,547 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640971379] [2019-11-07 03:54:51,548 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:54:51,548 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 03:54:51,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700994111] [2019-11-07 03:54:51,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 03:54:51,554 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:54:51,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 03:54:51,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 03:54:51,571 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-11-07 03:54:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:54:51,593 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-11-07 03:54:51,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 03:54:51,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-07 03:54:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:54:51,603 INFO L225 Difference]: With dead ends: 53 [2019-11-07 03:54:51,603 INFO L226 Difference]: Without dead ends: 24 [2019-11-07 03:54:51,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 03:54:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-07 03:54:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-07 03:54:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-07 03:54:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-11-07 03:54:51,645 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2019-11-07 03:54:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:54:51,646 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-07 03:54:51,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 03:54:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-11-07 03:54:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 03:54:51,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:54:51,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:54:51,648 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:54:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:54:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1996990469, now seen corresponding path program 1 times [2019-11-07 03:54:51,649 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:54:51,649 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382903016] [2019-11-07 03:54:51,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:54:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:54:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:54:51,764 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382903016] [2019-11-07 03:54:51,764 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:54:51,765 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 03:54:51,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186739004] [2019-11-07 03:54:51,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 03:54:51,767 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:54:51,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 03:54:51,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 03:54:51,768 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 5 states. [2019-11-07 03:54:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:54:51,900 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-11-07 03:54:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 03:54:51,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-07 03:54:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:54:51,904 INFO L225 Difference]: With dead ends: 49 [2019-11-07 03:54:51,904 INFO L226 Difference]: Without dead ends: 45 [2019-11-07 03:54:51,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 03:54:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-07 03:54:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-11-07 03:54:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 03:54:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-11-07 03:54:51,913 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 19 [2019-11-07 03:54:51,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:54:51,914 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-11-07 03:54:51,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 03:54:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-11-07 03:54:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 03:54:51,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:54:51,915 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:54:51,916 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:54:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:54:51,916 INFO L82 PathProgramCache]: Analyzing trace with hash -693863968, now seen corresponding path program 1 times [2019-11-07 03:54:51,916 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:54:51,917 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393551882] [2019-11-07 03:54:51,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:54:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:54:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:54:52,014 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393551882] [2019-11-07 03:54:52,014 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:54:52,014 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 03:54:52,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974481065] [2019-11-07 03:54:52,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 03:54:52,015 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:54:52,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 03:54:52,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 03:54:52,016 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 5 states. [2019-11-07 03:54:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:54:52,120 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-11-07 03:54:52,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 03:54:52,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-07 03:54:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:54:52,121 INFO L225 Difference]: With dead ends: 51 [2019-11-07 03:54:52,121 INFO L226 Difference]: Without dead ends: 43 [2019-11-07 03:54:52,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 03:54:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-07 03:54:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-11-07 03:54:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:54:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-07 03:54:52,128 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2019-11-07 03:54:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:54:52,129 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-07 03:54:52,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 03:54:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-11-07 03:54:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 03:54:52,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:54:52,130 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:54:52,130 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:54:52,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:54:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash 330839008, now seen corresponding path program 1 times [2019-11-07 03:54:52,131 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:54:52,131 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414955945] [2019-11-07 03:54:52,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:54:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:54:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:54:52,212 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414955945] [2019-11-07 03:54:52,212 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:54:52,212 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 03:54:52,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342307608] [2019-11-07 03:54:52,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 03:54:52,214 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:54:52,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 03:54:52,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 03:54:52,214 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2019-11-07 03:54:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:54:52,314 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-11-07 03:54:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 03:54:52,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-07 03:54:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:54:52,316 INFO L225 Difference]: With dead ends: 51 [2019-11-07 03:54:52,316 INFO L226 Difference]: Without dead ends: 40 [2019-11-07 03:54:52,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 03:54:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-07 03:54:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-07 03:54:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-07 03:54:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-07 03:54:52,321 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 21 [2019-11-07 03:54:52,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:54:52,322 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-07 03:54:52,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 03:54:52,322 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-07 03:54:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 03:54:52,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:54:52,323 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:54:52,323 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:54:52,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:54:52,324 INFO L82 PathProgramCache]: Analyzing trace with hash -441963284, now seen corresponding path program 1 times [2019-11-07 03:54:52,324 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:54:52,324 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583196953] [2019-11-07 03:54:52,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:54:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:54:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:54:52,480 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583196953] [2019-11-07 03:54:52,481 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447906095] [2019-11-07 03:54:52,481 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-11-07 03:54:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:54:52,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-07 03:54:52,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 03:54:52,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-07 03:54:52,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 03:54:52,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-07 03:54:52,731 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 03:54:52,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-07 03:54:52,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 03:54:52,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-07 03:54:52,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 03:54:52,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-07 03:54:52,791 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-07 03:54:52,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-07 03:54:52,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 03:54:52,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-07 03:54:52,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-07 03:54:52,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 03:54:52,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-07 03:54:52,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-07 03:54:52,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-07 03:54:52,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 03:54:52,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-07 03:54:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:54:52,885 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 03:54:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:54:52,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 03:54:52,933 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 03:54:52,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 03:54:52,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-07 03:54:52,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:22 [2019-11-07 03:54:52,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:54:53,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 162 [2019-11-07 03:54:53,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:54:53,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:54:53,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:54:53,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 03:54:53,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:54:53,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 03:54:53,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 03:54:53,149 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2019-11-07 03:54:53,150 INFO L567 ElimStorePlain]: treesize reduction 307, result has 10.2 percent of original size [2019-11-07 03:54:53,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-07 03:54:53,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-07 03:54:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:54:53,287 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1334561837] [2019-11-07 03:54:53,315 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 03:54:53,316 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 03:54:53,321 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 03:54:53,339 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 03:54:53,339 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 03:54:53,441 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 03:54:54,110 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 03:54:54,112 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 03:54:54,460 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-07 03:54:54,800 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-11-07 03:54:55,140 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 03:54:55,141 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 17] total 29 [2019-11-07 03:54:55,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184098210] [2019-11-07 03:54:55,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-07 03:54:55,143 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:54:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-07 03:54:55,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2019-11-07 03:54:55,145 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 29 states. [2019-11-07 03:54:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:54:56,827 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-07 03:54:56,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-07 03:54:56,829 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 23 [2019-11-07 03:54:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:54:56,830 INFO L225 Difference]: With dead ends: 57 [2019-11-07 03:54:56,830 INFO L226 Difference]: Without dead ends: 49 [2019-11-07 03:54:56,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=348, Invalid=2004, Unknown=0, NotChecked=0, Total=2352 [2019-11-07 03:54:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-07 03:54:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2019-11-07 03:54:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-07 03:54:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-11-07 03:54:56,841 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2019-11-07 03:54:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:54:56,841 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-11-07 03:54:56,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-07 03:54:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-11-07 03:54:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 03:54:56,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:54:56,843 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:54:57,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:54:57,045 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:54:57,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:54:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash 421438380, now seen corresponding path program 1 times [2019-11-07 03:54:57,046 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:54:57,047 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495390118] [2019-11-07 03:54:57,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:54:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:54:57,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:54:57,213 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495390118] [2019-11-07 03:54:57,213 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077123414] [2019-11-07 03:54:57,213 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-11-07 03:54:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:54:57,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-07 03:54:57,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 03:54:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:54:57,486 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 03:54:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:54:57,697 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1974375020] [2019-11-07 03:54:57,699 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 03:54:57,700 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 03:54:57,700 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 03:54:57,700 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 03:54:57,701 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 03:54:57,730 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 03:54:57,944 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-07 03:54:58,048 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 03:54:58,050 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 03:54:58,648 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 03:54:58,649 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 16] total 28 [2019-11-07 03:54:58,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360333684] [2019-11-07 03:54:58,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-07 03:54:58,650 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:54:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-07 03:54:58,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2019-11-07 03:54:58,652 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 28 states. [2019-11-07 03:55:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:55:00,273 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-11-07 03:55:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-07 03:55:00,276 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 23 [2019-11-07 03:55:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:55:00,277 INFO L225 Difference]: With dead ends: 49 [2019-11-07 03:55:00,277 INFO L226 Difference]: Without dead ends: 43 [2019-11-07 03:55:00,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=282, Invalid=1788, Unknown=0, NotChecked=0, Total=2070 [2019-11-07 03:55:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-07 03:55:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-11-07 03:55:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:55:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-11-07 03:55:00,284 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2019-11-07 03:55:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:55:00,284 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-11-07 03:55:00,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-07 03:55:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-11-07 03:55:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 03:55:00,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:55:00,285 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:55:00,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:55:00,487 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:55:00,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:55:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash 523723015, now seen corresponding path program 1 times [2019-11-07 03:55:00,488 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:55:00,488 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650145563] [2019-11-07 03:55:00,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:55:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:55:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:55:00,628 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650145563] [2019-11-07 03:55:00,628 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829418376] [2019-11-07 03:55:00,628 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-11-07 03:55:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:55:00,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-07 03:55:00,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 03:55:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:55:01,041 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 03:55:01,283 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-11-07 03:55:01,494 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-11-07 03:55:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:55:01,635 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076591791] [2019-11-07 03:55:01,637 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 03:55:01,637 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 03:55:01,638 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 03:55:01,638 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 03:55:01,638 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 03:55:01,666 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 03:55:02,109 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 03:55:02,111 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 03:55:02,884 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 03:55:02,884 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 15] total 32 [2019-11-07 03:55:02,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065189707] [2019-11-07 03:55:02,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-07 03:55:02,885 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:55:02,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-07 03:55:02,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2019-11-07 03:55:02,887 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 32 states. [2019-11-07 03:55:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:55:05,197 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-11-07 03:55:05,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-07 03:55:05,202 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 25 [2019-11-07 03:55:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:55:05,203 INFO L225 Difference]: With dead ends: 71 [2019-11-07 03:55:05,203 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 03:55:05,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=378, Invalid=2484, Unknown=0, NotChecked=0, Total=2862 [2019-11-07 03:55:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 03:55:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2019-11-07 03:55:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-07 03:55:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-11-07 03:55:05,212 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 25 [2019-11-07 03:55:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:55:05,212 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-11-07 03:55:05,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-07 03:55:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-11-07 03:55:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 03:55:05,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:55:05,214 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:55:05,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:55:05,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:55:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:55:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash 835320418, now seen corresponding path program 2 times [2019-11-07 03:55:05,418 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:55:05,419 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642411122] [2019-11-07 03:55:05,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:55:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:55:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:55:05,559 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642411122] [2019-11-07 03:55:05,559 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903140374] [2019-11-07 03:55:05,559 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:55:05,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-07 03:55:05,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 03:55:05,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-07 03:55:05,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 03:55:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:55:05,927 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 03:55:06,180 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-07 03:55:06,368 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-11-07 03:55:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:55:06,550 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [740909612] [2019-11-07 03:55:06,551 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 03:55:06,552 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 03:55:06,552 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 03:55:06,553 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 03:55:06,553 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 03:55:06,573 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 03:55:07,018 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 03:55:07,020 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 03:55:07,598 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-11-07 03:55:07,818 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 03:55:07,818 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 15] total 31 [2019-11-07 03:55:07,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119863531] [2019-11-07 03:55:07,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-07 03:55:07,819 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:55:07,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-07 03:55:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2019-11-07 03:55:07,820 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 31 states. [2019-11-07 03:55:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:55:09,828 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-11-07 03:55:09,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-07 03:55:09,828 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-11-07 03:55:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:55:09,829 INFO L225 Difference]: With dead ends: 73 [2019-11-07 03:55:09,829 INFO L226 Difference]: Without dead ends: 60 [2019-11-07 03:55:09,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=326, Invalid=2430, Unknown=0, NotChecked=0, Total=2756 [2019-11-07 03:55:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-07 03:55:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-11-07 03:55:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-07 03:55:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-11-07 03:55:09,838 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 27 [2019-11-07 03:55:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:55:09,839 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-11-07 03:55:09,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-07 03:55:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-11-07 03:55:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 03:55:09,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:55:09,840 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:55:10,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:55:10,058 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:55:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:55:10,059 INFO L82 PathProgramCache]: Analyzing trace with hash -943192798, now seen corresponding path program 1 times [2019-11-07 03:55:10,059 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:55:10,060 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209706833] [2019-11-07 03:55:10,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:55:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:55:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:55:10,181 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209706833] [2019-11-07 03:55:10,181 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861681377] [2019-11-07 03:55:10,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:55:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:55:10,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-07 03:55:10,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 03:55:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:55:10,542 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 03:55:10,976 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 34 [2019-11-07 03:55:11,094 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-11-07 03:55:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:55:11,238 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [739313417] [2019-11-07 03:55:11,241 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-11-07 03:55:11,242 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 03:55:11,242 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 03:55:11,243 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 03:55:11,243 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 03:55:11,267 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-11-07 03:55:11,528 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-07 03:55:11,671 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-11-07 03:55:11,676 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 03:55:12,127 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-07 03:55:12,506 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 03:55:12,506 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 14] total 33 [2019-11-07 03:55:12,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052302519] [2019-11-07 03:55:12,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-07 03:55:12,507 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:55:12,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-07 03:55:12,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-11-07 03:55:12,508 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 33 states. [2019-11-07 03:55:13,163 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-07 03:55:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:55:14,923 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-11-07 03:55:14,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-07 03:55:14,923 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 27 [2019-11-07 03:55:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:55:14,924 INFO L225 Difference]: With dead ends: 68 [2019-11-07 03:55:14,924 INFO L226 Difference]: Without dead ends: 55 [2019-11-07 03:55:14,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=397, Invalid=2909, Unknown=0, NotChecked=0, Total=3306 [2019-11-07 03:55:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-07 03:55:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-07 03:55:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-07 03:55:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-07 03:55:14,939 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 27 [2019-11-07 03:55:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:55:14,940 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-07 03:55:14,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-07 03:55:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-07 03:55:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 03:55:14,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:55:14,941 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:55:15,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:55:15,142 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:55:15,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:55:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2010882898, now seen corresponding path program 3 times [2019-11-07 03:55:15,142 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:55:15,142 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408937586] [2019-11-07 03:55:15,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:55:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:55:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:55:15,468 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408937586] [2019-11-07 03:55:15,468 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474427635] [2019-11-07 03:55:15,468 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:55:15,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-07 03:55:15,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 03:55:15,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-07 03:55:15,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 03:55:16,095 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-07 03:55:16,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 03:55:16,355 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:178) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-07 03:55:16,361 INFO L168 Benchmark]: Toolchain (without parser) took 26481.91 ms. Allocated memory was 142.1 MB in the beginning and 469.8 MB in the end (delta: 327.7 MB). Free memory was 97.9 MB in the beginning and 316.1 MB in the end (delta: -218.2 MB). Peak memory consumption was 109.5 MB. Max. memory is 7.1 GB. [2019-11-07 03:55:16,361 INFO L168 Benchmark]: CDTParser took 1.29 ms. Allocated memory is still 142.1 MB. Free memory was 117.1 MB in the beginning and 116.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 03:55:16,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 657.36 ms. Allocated memory was 142.1 MB in the beginning and 200.8 MB in the end (delta: 58.7 MB). Free memory was 97.7 MB in the beginning and 167.4 MB in the end (delta: -69.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-11-07 03:55:16,362 INFO L168 Benchmark]: Boogie Preprocessor took 60.34 ms. Allocated memory is still 200.8 MB. Free memory was 167.4 MB in the beginning and 164.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-11-07 03:55:16,362 INFO L168 Benchmark]: RCFGBuilder took 710.24 ms. Allocated memory is still 200.8 MB. Free memory was 163.9 MB in the beginning and 117.3 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-11-07 03:55:16,362 INFO L168 Benchmark]: TraceAbstraction took 25049.51 ms. Allocated memory was 200.8 MB in the beginning and 469.8 MB in the end (delta: 269.0 MB). Free memory was 117.3 MB in the beginning and 316.1 MB in the end (delta: -198.8 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 GB. [2019-11-07 03:55:16,364 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29 ms. Allocated memory is still 142.1 MB. Free memory was 117.1 MB in the beginning and 116.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 657.36 ms. Allocated memory was 142.1 MB in the beginning and 200.8 MB in the end (delta: 58.7 MB). Free memory was 97.7 MB in the beginning and 167.4 MB in the end (delta: -69.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.34 ms. Allocated memory is still 200.8 MB. Free memory was 167.4 MB in the beginning and 164.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 710.24 ms. Allocated memory is still 200.8 MB. Free memory was 163.9 MB in the beginning and 117.3 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25049.51 ms. Allocated memory was 200.8 MB in the beginning and 469.8 MB in the end (delta: 269.0 MB). Free memory was 117.3 MB in the beginning and 316.1 MB in the end (delta: -198.8 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...