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-f4eb214f-m [2019-10-13 22:55:52,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:55:52,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:55:52,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:55:52,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:55:52,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:55:52,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:55:52,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:55:52,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:55:52,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:55:52,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:55:52,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:55:52,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:55:52,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:55:52,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:55:52,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:55:52,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:55:52,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:55:52,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:55:52,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:55:52,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:55:52,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:55:52,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:55:52,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:55:52,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:55:52,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:55:52,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:55:52,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:55:52,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:55:52,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:55:52,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:55:52,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:55:52,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:55:52,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:55:52,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:55:52,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:55:52,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:55:52,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:55:52,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:55:52,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:55:52,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:55:52,668 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:55:52,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:55:52,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:55:52,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:55:52,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:55:52,694 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:55:52,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:55:52,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:55:52,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:55:52,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:55:52,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:55:52,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:55:52,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:55:52,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:55:52,697 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:55:52,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:55:52,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:55:52,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:55:52,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:55:52,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:55:52,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:55:52,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:55:52,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:55:52,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:55:52,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:55:52,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:55:52,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:55:52,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:55:52,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:55:52,700 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-10-13 22:55:53,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:55:53,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:55:53,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:55:53,019 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:55:53,019 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:55:53,020 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-10-13 22:55:53,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688b6e103/e4ca3c057be14fb0b4a7360f59f28827/FLAG9a5ceaffe [2019-10-13 22:55:53,611 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:55:53,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list-1.i [2019-10-13 22:55:53,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688b6e103/e4ca3c057be14fb0b4a7360f59f28827/FLAG9a5ceaffe [2019-10-13 22:55:53,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688b6e103/e4ca3c057be14fb0b4a7360f59f28827 [2019-10-13 22:55:53,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:55:53,991 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:55:53,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:55:53,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:55:53,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:55:53,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:53" (1/1) ... [2019-10-13 22:55:53,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdcfb87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:53, skipping insertion in model container [2019-10-13 22:55:53,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:53" (1/1) ... [2019-10-13 22:55:54,005 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:55:54,055 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:55:54,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:55:54,485 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:55:54,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:55:54,591 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:55:54,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:54 WrapperNode [2019-10-13 22:55:54,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:55:54,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:55:54,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:55:54,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:55:54,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:54" (1/1) ... [2019-10-13 22:55:54,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:54" (1/1) ... [2019-10-13 22:55:54,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:54" (1/1) ... [2019-10-13 22:55:54,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:54" (1/1) ... [2019-10-13 22:55:54,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:54" (1/1) ... [2019-10-13 22:55:54,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:54" (1/1) ... [2019-10-13 22:55:54,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:54" (1/1) ... [2019-10-13 22:55:54,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:55:54,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:55:54,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:55:54,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:55:54,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:55:54,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:55:54,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:55:54,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 22:55:54,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 22:55:54,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-10-13 22:55:54,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-10-13 22:55:54,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-10-13 22:55:54,730 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-13 22:55:54,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:55:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:55:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:55:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 22:55:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 22:55:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 22:55:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 22:55:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 22:55:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 22:55:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 22:55:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 22:55:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 22:55:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 22:55:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 22:55:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 22:55:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 22:55:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 22:55:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 22:55:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 22:55:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 22:55:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 22:55:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-10-13 22:55:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-10-13 22:55:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-10-13 22:55:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 22:55:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 22:55:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 22:55:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 22:55:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 22:55:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 22:55:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 22:55:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 22:55:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 22:55:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 22:55:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 22:55:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 22:55:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 22:55:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 22:55:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 22:55:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 22:55:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 22:55:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 22:55:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 22:55:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 22:55:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 22:55:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 22:55:54,738 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 22:55:54,738 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 22:55:54,738 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 22:55:54,738 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 22:55:54,738 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 22:55:54,738 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 22:55:54,739 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 22:55:54,739 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 22:55:54,739 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 22:55:54,739 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 22:55:54,739 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 22:55:54,739 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 22:55:54,739 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 22:55:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 22:55:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 22:55:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 22:55:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 22:55:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 22:55:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 22:55:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 22:55:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 22:55:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 22:55:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 22:55:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 22:55:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 22:55:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 22:55:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 22:55:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 22:55:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 22:55:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 22:55:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 22:55:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 22:55:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 22:55:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 22:55:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 22:55:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 22:55:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 22:55:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 22:55:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 22:55:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 22:55:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 22:55:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 22:55:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 22:55:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 22:55:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 22:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 22:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 22:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 22:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 22:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 22:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 22:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 22:55:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 22:55:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 22:55:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 22:55:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 22:55:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 22:55:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 22:55:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 22:55:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 22:55:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 22:55:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 22:55:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 22:55:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 22:55:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-13 22:55:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:55:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 22:55:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:55:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 22:55:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 22:55:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:55:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:55:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:55:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:55:55,087 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-13 22:55:55,293 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:55:55,293 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 22:55:55,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:55 BoogieIcfgContainer [2019-10-13 22:55:55,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:55:55,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:55:55,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:55:55,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:55:55,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:55:53" (1/3) ... [2019-10-13 22:55:55,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d835b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:55, skipping insertion in model container [2019-10-13 22:55:55,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:54" (2/3) ... [2019-10-13 22:55:55,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d835b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:55, skipping insertion in model container [2019-10-13 22:55:55,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:55" (3/3) ... [2019-10-13 22:55:55,307 INFO L109 eAbstractionObserver]: Analyzing ICFG list-1.i [2019-10-13 22:55:55,316 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:55:55,324 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:55:55,346 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:55:55,371 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:55:55,371 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:55:55,371 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:55:55,372 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:55:55,372 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:55:55,372 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:55:55,372 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:55:55,372 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:55:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-13 22:55:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:55:55,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:55,395 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:55:55,397 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash 725742413, now seen corresponding path program 1 times [2019-10-13 22:55:55,412 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:55,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595065094] [2019-10-13 22:55:55,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:55,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:55,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:55:55,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595065094] [2019-10-13 22:55:55,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:55,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 22:55:55,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133632318] [2019-10-13 22:55:55,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 22:55:55,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:55,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 22:55:55,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 22:55:55,566 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-10-13 22:55:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:55,585 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-10-13 22:55:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 22:55:55,587 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-13 22:55:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:55,594 INFO L225 Difference]: With dead ends: 53 [2019-10-13 22:55:55,595 INFO L226 Difference]: Without dead ends: 24 [2019-10-13 22:55:55,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 22:55:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-13 22:55:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-13 22:55:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 22:55:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-13 22:55:55,631 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2019-10-13 22:55:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:55,631 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-13 22:55:55,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 22:55:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-13 22:55:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 22:55:55,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:55,632 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:55:55,633 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:55,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1996990469, now seen corresponding path program 1 times [2019-10-13 22:55:55,634 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:55,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431619671] [2019-10-13 22:55:55,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:55,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:55,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:55:55,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431619671] [2019-10-13 22:55:55,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:55,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:55:55,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687277704] [2019-10-13 22:55:55,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:55:55,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:55,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:55:55,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:55:55,816 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 5 states. [2019-10-13 22:55:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:55,986 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-10-13 22:55:55,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:55:55,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-13 22:55:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:55,991 INFO L225 Difference]: With dead ends: 49 [2019-10-13 22:55:55,991 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 22:55:55,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:55:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 22:55:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-10-13 22:55:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 22:55:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-10-13 22:55:56,010 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 19 [2019-10-13 22:55:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:56,011 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-10-13 22:55:56,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:55:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-10-13 22:55:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 22:55:56,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:56,012 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:55:56,013 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:56,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:56,014 INFO L82 PathProgramCache]: Analyzing trace with hash -693863968, now seen corresponding path program 1 times [2019-10-13 22:55:56,014 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:56,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599428457] [2019-10-13 22:55:56,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:56,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:56,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:55:56,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599428457] [2019-10-13 22:55:56,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:56,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:55:56,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658756235] [2019-10-13 22:55:56,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:55:56,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:56,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:55:56,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:55:56,112 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 5 states. [2019-10-13 22:55:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:56,242 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-10-13 22:55:56,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:55:56,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-13 22:55:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:56,244 INFO L225 Difference]: With dead ends: 51 [2019-10-13 22:55:56,244 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 22:55:56,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:55:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 22:55:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-10-13 22:55:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 22:55:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-13 22:55:56,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2019-10-13 22:55:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:56,251 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-13 22:55:56,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:55:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-13 22:55:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 22:55:56,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:56,252 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:55:56,253 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:56,253 INFO L82 PathProgramCache]: Analyzing trace with hash 330839008, now seen corresponding path program 1 times [2019-10-13 22:55:56,253 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:56,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708076209] [2019-10-13 22:55:56,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:56,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:56,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:55:56,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708076209] [2019-10-13 22:55:56,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:55:56,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:55:56,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980236442] [2019-10-13 22:55:56,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:55:56,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:55:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:55:56,327 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2019-10-13 22:55:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:55:56,443 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-10-13 22:55:56,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:55:56,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-13 22:55:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:55:56,446 INFO L225 Difference]: With dead ends: 51 [2019-10-13 22:55:56,446 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 22:55:56,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:55:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 22:55:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-10-13 22:55:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 22:55:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-13 22:55:56,454 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 21 [2019-10-13 22:55:56,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:55:56,454 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-13 22:55:56,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:55:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-13 22:55:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 22:55:56,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:55:56,456 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:55:56,457 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:55:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:55:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash -441963284, now seen corresponding path program 1 times [2019-10-13 22:55:56,457 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:55:56,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254073722] [2019-10-13 22:55:56,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:56,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:55:56,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:55:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:55:56,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254073722] [2019-10-13 22:55:56,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998667653] [2019-10-13 22:55:56,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:55:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:55:56,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 22:55:56,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:55:56,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 22:55:56,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:55:56,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:55:56,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 22:55:56,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 22:55:56,868 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:55:56,869 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-10-13 22:55:56,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:55:56,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:55:56,889 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-10-13 22:55:56,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 22:55:56,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:55:56,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 22:55:56,901 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-10-13 22:55:56,944 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 22:55:56,945 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-10-13 22:55:56,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:55:56,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:55:56,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 22:55:56,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-10-13 22:55:56,990 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-10-13 22:55:56,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:55:57,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:55:57,004 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-10-13 22:55:57,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-10-13 22:55:57,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-13 22:55:57,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:55:57,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:55:57,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 22:55:57,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-13 22:55:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:55:57,066 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:55:57,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:55:57,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:55:57,132 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 22:55:57,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:55:57,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-13 22:55:57,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:22 [2019-10-13 22:55:57,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:55:57,193 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-10-13 22:55:57,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:55:57,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:55:57,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:55:57,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 22:55:57,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:55:57,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:55:57,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:55:57,325 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 27 [2019-10-13 22:55:57,326 INFO L567 ElimStorePlain]: treesize reduction 307, result has 10.2 percent of original size [2019-10-13 22:55:57,327 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-10-13 22:55:57,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-10-13 22:55:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:55:57,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1337070611] [2019-10-13 22:55:57,479 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:55:57,479 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:55:57,492 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:55:57,513 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:55:57,513 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:55:57,610 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 22:55:58,883 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:55:58,890 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:55:58,891 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:55:58,891 INFO L193 IcfgInterpreter]: Reachable states at location L545 satisfy 352#(= |main_#t~mem13| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2019-10-13 22:55:58,891 INFO L193 IcfgInterpreter]: Reachable states at location L525-1 satisfy 53#(and (<= |main_#t~malloc2.offset| 0) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= |main_#t~nondet3| 2147483647) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~p~0.offset) (<= main_~p~0.offset 0) (<= 0 (+ |main_#t~nondet3| 2147483648))) [2019-10-13 22:55:58,892 INFO L193 IcfgInterpreter]: Reachable states at location L535 satisfy 219#(and (<= main_~t~0.offset 0) (<= 0 main_~t~0.offset) (<= |main_#t~malloc7.offset| 0) (<= 0 |main_#t~malloc7.offset|) (= |main_#t~malloc7.offset| 0)) [2019-10-13 22:55:58,892 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 361#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:55:58,892 INFO L193 IcfgInterpreter]: Reachable states at location L546 satisfy 342#(not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:55:58,892 INFO L193 IcfgInterpreter]: Reachable states at location L541-3 satisfy 257#true [2019-10-13 22:55:58,893 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:55:58,893 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:55:58,894 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 366#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:55:58,894 INFO L193 IcfgInterpreter]: Reachable states at location L532-3 satisfy 252#true [2019-10-13 22:55:58,894 INFO L193 IcfgInterpreter]: Reachable states at location L541-1 satisfy 262#true [2019-10-13 22:55:58,894 INFO L193 IcfgInterpreter]: Reachable states at location L543-3 satisfy 357#true [2019-10-13 22:55:58,894 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:55:58,895 INFO L193 IcfgInterpreter]: Reachable states at location L522-3 satisfy 43#(and (<= |main_#t~malloc2.offset| 0) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:55:58,895 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 327#(not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:55:58,895 INFO L193 IcfgInterpreter]: Reachable states at location L532-2 satisfy 115#true [2019-10-13 22:55:58,895 INFO L193 IcfgInterpreter]: Reachable states at location L543-2 satisfy 271#true [2019-10-13 22:55:58,896 INFO L193 IcfgInterpreter]: Reachable states at location L532 satisfy 123#(and (<= 0 (+ |main_#t~nondet6| 2147483648)) (<= |main_#t~nondet6| 2147483647)) [2019-10-13 22:55:58,896 INFO L193 IcfgInterpreter]: Reachable states at location L535-3 satisfy 107#true [2019-10-13 22:55:58,896 INFO L193 IcfgInterpreter]: Reachable states at location L543 satisfy 279#true [2019-10-13 22:55:58,896 INFO L193 IcfgInterpreter]: Reachable states at location L525-3 satisfy 48#(and (<= 0 main_~p~0.offset) (<= |main_#t~malloc2.offset| 0) (<= main_~p~0.offset 0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:55:58,896 INFO L193 IcfgInterpreter]: Reachable states at location L522 satisfy 38#(and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~a~0.offset 0) (= 0 |main_#t~malloc2.offset|) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |main_#t~malloc2.offset|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:55:59,273 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-10-13 22:55:59,549 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-10-13 22:55:59,752 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-10-13 22:55:59,844 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:55:59,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 12] total 24 [2019-10-13 22:55:59,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727438999] [2019-10-13 22:55:59,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 22:55:59,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:55:59,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 22:55:59,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-10-13 22:55:59,847 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 24 states. [2019-10-13 22:56:00,549 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-13 22:56:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:01,527 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-10-13 22:56:01,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 22:56:01,528 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-10-13 22:56:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:01,529 INFO L225 Difference]: With dead ends: 72 [2019-10-13 22:56:01,529 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 22:56:01,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=360, Invalid=1802, Unknown=0, NotChecked=0, Total=2162 [2019-10-13 22:56:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 22:56:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2019-10-13 22:56:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 22:56:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-10-13 22:56:01,538 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 23 [2019-10-13 22:56:01,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:01,538 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-10-13 22:56:01,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 22:56:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-10-13 22:56:01,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 22:56:01,539 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:01,539 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:56:01,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:01,748 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:01,749 INFO L82 PathProgramCache]: Analyzing trace with hash 421438380, now seen corresponding path program 1 times [2019-10-13 22:56:01,749 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:01,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527909183] [2019-10-13 22:56:01,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:01,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:01,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:01,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527909183] [2019-10-13 22:56:01,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525860553] [2019-10-13 22:56:01,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:01,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 22:56:01,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:02,102 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:02,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1959791605] [2019-10-13 22:56:02,282 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:56:02,282 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:56:02,283 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:56:02,283 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:56:02,283 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:56:02,311 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 22:56:02,551 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:02,658 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:56:02,662 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:56:02,662 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:56:02,662 INFO L193 IcfgInterpreter]: Reachable states at location L545 satisfy 135#(and (= |main_#t~mem13| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_37 Int) (v_main_~p~0.offset_37 Int)) (and (not (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset) (= (select (select |#memory_int| v_main_~p~0.base_37) v_main_~p~0.offset_37) 3)))) [2019-10-13 22:56:02,662 INFO L193 IcfgInterpreter]: Reachable states at location L525-1 satisfy 80#(and (<= |main_#t~nondet3| 2147483647) (<= 0 (+ |main_#t~nondet3| 2147483648))) [2019-10-13 22:56:02,663 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 149#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:56:02,663 INFO L193 IcfgInterpreter]: Reachable states at location L546 satisfy 140#(exists ((v_main_~p~0.base_37 Int) (v_main_~p~0.offset_37 Int)) (and (not (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset) (not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= (select (select |#memory_int| v_main_~p~0.base_37) v_main_~p~0.offset_37) 3))) [2019-10-13 22:56:02,663 INFO L193 IcfgInterpreter]: Reachable states at location L528-3 satisfy 90#(and (<= main_~t~0.offset 0) (<= |main_#t~malloc4.offset| 0) (<= 0 main_~t~0.offset) (or (and (= |main_#t~malloc4.base| main_~t~0.base) (= (select |#length| |main_#t~malloc4.base|) 8) (= main_~t~0.offset |main_#t~malloc4.offset|) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= |main_#t~malloc4.base| 0)) (not (= main_~t~0.base 0)) (= 0 |main_#t~malloc4.offset|) (< |#StackHeapBarrier| |main_#t~malloc4.base|)) (and (not (= main_~t~0.offset 0)) (= |main_#t~malloc4.base| main_~t~0.base) (= (select |#length| |main_#t~malloc4.base|) 8) (= main_~t~0.offset |main_#t~malloc4.offset|) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= |main_#t~malloc4.base| 0)) (= 0 |main_#t~malloc4.offset|) (< |#StackHeapBarrier| |main_#t~malloc4.base|))) (<= 0 |main_#t~malloc4.offset|)) [2019-10-13 22:56:02,663 INFO L193 IcfgInterpreter]: Reachable states at location L541-3 satisfy 110#(exists ((v_main_~p~0.base_37 Int) (v_main_~p~0.offset_37 Int)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset) (= (select (select |#memory_int| v_main_~p~0.base_37) v_main_~p~0.offset_37) 3))) [2019-10-13 22:56:02,663 INFO L193 IcfgInterpreter]: Reachable states at location L528 satisfy 85#(and (<= main_~t~0.offset 0) (<= |main_#t~malloc4.offset| 0) (<= 0 main_~t~0.offset) (= |main_#t~malloc4.base| main_~t~0.base) (= (select |#length| |main_#t~malloc4.base|) 8) (= main_~t~0.offset |main_#t~malloc4.offset|) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= |main_#t~malloc4.base| 0)) (= 0 |main_#t~malloc4.offset|) (< |#StackHeapBarrier| |main_#t~malloc4.base|) (<= 0 |main_#t~malloc4.offset|)) [2019-10-13 22:56:02,663 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:02,664 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:02,664 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 154#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:02,664 INFO L193 IcfgInterpreter]: Reachable states at location L532-3 satisfy 105#true [2019-10-13 22:56:02,664 INFO L193 IcfgInterpreter]: Reachable states at location L541-1 satisfy 115#(and (exists ((v_main_~p~0.base_37 Int) (v_main_~p~0.offset_37 Int)) (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset) (= (select (select |#memory_int| v_main_~p~0.base_37) v_main_~p~0.offset_37) 3))) (= |main_#t~mem9| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:56:02,664 INFO L193 IcfgInterpreter]: Reachable states at location L543-3 satisfy 130#(exists ((v_main_~p~0.base_37 Int) (v_main_~p~0.offset_37 Int)) (and (not (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset) (= (select (select |#memory_int| v_main_~p~0.base_37) v_main_~p~0.offset_37) 3))) [2019-10-13 22:56:02,665 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:56:02,665 INFO L193 IcfgInterpreter]: Reachable states at location L522-3 satisfy 43#(and (<= |main_#t~malloc2.offset| 0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:02,665 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 145#(exists ((v_main_~p~0.base_37 Int) (v_main_~p~0.offset_37 Int)) (and (not (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset) (not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= (select (select |#memory_int| v_main_~p~0.base_37) v_main_~p~0.offset_37) 3))) [2019-10-13 22:56:02,665 INFO L193 IcfgInterpreter]: Reachable states at location L532-2 satisfy 95#true [2019-10-13 22:56:02,665 INFO L193 IcfgInterpreter]: Reachable states at location L543-2 satisfy 120#(exists ((v_main_~p~0.base_37 Int) (v_main_~p~0.offset_37 Int)) (and (not (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset) (= (select (select |#memory_int| v_main_~p~0.base_37) v_main_~p~0.offset_37) 3))) [2019-10-13 22:56:02,666 INFO L193 IcfgInterpreter]: Reachable states at location L532 satisfy 100#(and (<= 0 (+ |main_#t~nondet6| 2147483648)) (<= |main_#t~nondet6| 2147483647)) [2019-10-13 22:56:02,666 INFO L193 IcfgInterpreter]: Reachable states at location L543 satisfy 125#(and (exists ((v_main_~p~0.base_37 Int) (v_main_~p~0.offset_37 Int)) (and (not (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset) (= (select (select |#memory_int| v_main_~p~0.base_37) v_main_~p~0.offset_37) 3))) (= |main_#t~mem11| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:56:02,666 INFO L193 IcfgInterpreter]: Reachable states at location L525-3 satisfy 75#true [2019-10-13 22:56:02,666 INFO L193 IcfgInterpreter]: Reachable states at location L522 satisfy 38#(and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~a~0.offset 0) (= 0 |main_#t~malloc2.offset|) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:03,366 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:56:03,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 16] total 28 [2019-10-13 22:56:03,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274931939] [2019-10-13 22:56:03,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 22:56:03,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:03,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 22:56:03,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2019-10-13 22:56:03,368 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 28 states. [2019-10-13 22:56:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:05,097 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-10-13 22:56:05,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 22:56:05,097 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 23 [2019-10-13 22:56:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:05,099 INFO L225 Difference]: With dead ends: 49 [2019-10-13 22:56:05,099 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 22:56:05,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=282, Invalid=1788, Unknown=0, NotChecked=0, Total=2070 [2019-10-13 22:56:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 22:56:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-10-13 22:56:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 22:56:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-10-13 22:56:05,107 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 23 [2019-10-13 22:56:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:05,107 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-13 22:56:05,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 22:56:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-10-13 22:56:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 22:56:05,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:05,108 INFO L380 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-10-13 22:56:05,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:05,312 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash 523723015, now seen corresponding path program 1 times [2019-10-13 22:56:05,313 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:05,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577847568] [2019-10-13 22:56:05,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:05,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:05,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:05,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577847568] [2019-10-13 22:56:05,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016335964] [2019-10-13 22:56:05,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:05,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-13 22:56:05,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:05,891 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:06,159 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-10-13 22:56:06,326 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-10-13 22:56:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:06,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1093953619] [2019-10-13 22:56:06,526 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:56:06,527 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:56:06,527 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:56:06,527 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:56:06,528 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:56:06,553 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 22:56:07,246 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:56:07,253 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:56:07,253 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:56:07,253 INFO L193 IcfgInterpreter]: Reachable states at location L545 satisfy 396#(= |main_#t~mem13| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2019-10-13 22:56:07,254 INFO L193 IcfgInterpreter]: Reachable states at location L525-1 satisfy 53#(and (<= |main_#t~malloc2.offset| 0) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= |main_#t~nondet3| 2147483647) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~p~0.offset) (<= main_~p~0.offset 0) (<= 0 (+ |main_#t~nondet3| 2147483648))) [2019-10-13 22:56:07,254 INFO L193 IcfgInterpreter]: Reachable states at location L535 satisfy 219#(and (<= main_~t~0.offset 0) (<= 0 main_~t~0.offset) (<= |main_#t~malloc7.offset| 0) (<= 0 |main_#t~malloc7.offset|) (= |main_#t~malloc7.offset| 0)) [2019-10-13 22:56:07,254 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 440#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:56:07,254 INFO L193 IcfgInterpreter]: Reachable states at location L546 satisfy 376#(not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:56:07,254 INFO L193 IcfgInterpreter]: Reachable states at location L541-3 satisfy 257#true [2019-10-13 22:56:07,255 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:07,255 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:07,255 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 445#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:07,255 INFO L193 IcfgInterpreter]: Reachable states at location L532-3 satisfy 252#true [2019-10-13 22:56:07,255 INFO L193 IcfgInterpreter]: Reachable states at location L541-1 satisfy 262#true [2019-10-13 22:56:07,255 INFO L193 IcfgInterpreter]: Reachable states at location L543-3 satisfy 426#true [2019-10-13 22:56:07,256 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:56:07,256 INFO L193 IcfgInterpreter]: Reachable states at location L522-3 satisfy 43#(and (<= |main_#t~malloc2.offset| 0) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:07,256 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 351#(not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:56:07,256 INFO L193 IcfgInterpreter]: Reachable states at location L532-2 satisfy 115#true [2019-10-13 22:56:07,256 INFO L193 IcfgInterpreter]: Reachable states at location L543-2 satisfy 411#true [2019-10-13 22:56:07,257 INFO L193 IcfgInterpreter]: Reachable states at location L532 satisfy 123#(and (<= 0 (+ |main_#t~nondet6| 2147483648)) (<= |main_#t~nondet6| 2147483647)) [2019-10-13 22:56:07,257 INFO L193 IcfgInterpreter]: Reachable states at location L535-3 satisfy 107#true [2019-10-13 22:56:07,257 INFO L193 IcfgInterpreter]: Reachable states at location L543 satisfy 436#true [2019-10-13 22:56:07,257 INFO L193 IcfgInterpreter]: Reachable states at location L525-3 satisfy 48#(and (<= 0 main_~p~0.offset) (<= |main_#t~malloc2.offset| 0) (<= main_~p~0.offset 0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:07,257 INFO L193 IcfgInterpreter]: Reachable states at location L522 satisfy 38#(and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~a~0.offset 0) (= 0 |main_#t~malloc2.offset|) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |main_#t~malloc2.offset|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:07,814 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-10-13 22:56:08,011 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-10-13 22:56:08,091 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:56:08,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 12] total 29 [2019-10-13 22:56:08,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993032956] [2019-10-13 22:56:08,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 22:56:08,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:08,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 22:56:08,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2019-10-13 22:56:08,095 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 29 states. [2019-10-13 22:56:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:09,970 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2019-10-13 22:56:09,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 22:56:09,971 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-10-13 22:56:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:09,972 INFO L225 Difference]: With dead ends: 90 [2019-10-13 22:56:09,972 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 22:56:09,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=435, Invalid=2535, Unknown=0, NotChecked=0, Total=2970 [2019-10-13 22:56:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 22:56:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 57. [2019-10-13 22:56:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-13 22:56:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2019-10-13 22:56:09,982 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 25 [2019-10-13 22:56:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:09,982 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2019-10-13 22:56:09,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 22:56:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2019-10-13 22:56:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 22:56:09,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:09,984 INFO L380 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-10-13 22:56:10,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:10,187 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash 835320418, now seen corresponding path program 2 times [2019-10-13 22:56:10,188 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:10,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062434498] [2019-10-13 22:56:10,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:10,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:10,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:10,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062434498] [2019-10-13 22:56:10,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139016324] [2019-10-13 22:56:10,312 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-10-13 22:56:10,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 22:56:10,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:56:10,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-13 22:56:10,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:10,670 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:10,976 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-10-13 22:56:11,117 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-10-13 22:56:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:11,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1851124420] [2019-10-13 22:56:11,260 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:56:11,261 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:56:11,261 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:56:11,261 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:56:11,262 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:56:11,306 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 22:56:11,972 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:56:11,975 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:56:11,975 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:56:11,976 INFO L193 IcfgInterpreter]: Reachable states at location L545 satisfy 396#(= |main_#t~mem13| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2019-10-13 22:56:11,976 INFO L193 IcfgInterpreter]: Reachable states at location L525-1 satisfy 53#(and (<= |main_#t~malloc2.offset| 0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 main_~p~0.offset) (<= main_~p~0.offset 0) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (<= 0 |#NULL.base|) (<= |main_#t~nondet3| 2147483647) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (not (= main_~a~0.offset 0)) (<= |main_#t~nondet3| 2147483647) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 (+ |main_#t~nondet3| 2147483648))) [2019-10-13 22:56:11,976 INFO L193 IcfgInterpreter]: Reachable states at location L535 satisfy 219#(and (<= main_~t~0.offset 0) (<= 0 main_~t~0.offset) (<= |main_#t~malloc7.offset| 0) (<= 0 |main_#t~malloc7.offset|) (= |main_#t~malloc7.offset| 0)) [2019-10-13 22:56:11,976 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 440#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:56:11,977 INFO L193 IcfgInterpreter]: Reachable states at location L546 satisfy 376#(not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:56:11,977 INFO L193 IcfgInterpreter]: Reachable states at location L541-3 satisfy 257#true [2019-10-13 22:56:11,977 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:11,977 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:11,977 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 445#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:11,978 INFO L193 IcfgInterpreter]: Reachable states at location L532-3 satisfy 252#true [2019-10-13 22:56:11,978 INFO L193 IcfgInterpreter]: Reachable states at location L541-1 satisfy 262#true [2019-10-13 22:56:11,978 INFO L193 IcfgInterpreter]: Reachable states at location L543-3 satisfy 426#true [2019-10-13 22:56:11,978 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:56:11,978 INFO L193 IcfgInterpreter]: Reachable states at location L522-3 satisfy 43#(and (<= |main_#t~malloc2.offset| 0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:11,979 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 351#(not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:56:11,979 INFO L193 IcfgInterpreter]: Reachable states at location L532-2 satisfy 115#true [2019-10-13 22:56:11,979 INFO L193 IcfgInterpreter]: Reachable states at location L543-2 satisfy 411#true [2019-10-13 22:56:11,979 INFO L193 IcfgInterpreter]: Reachable states at location L532 satisfy 123#(and (<= 0 (+ |main_#t~nondet6| 2147483648)) (<= |main_#t~nondet6| 2147483647)) [2019-10-13 22:56:11,979 INFO L193 IcfgInterpreter]: Reachable states at location L535-3 satisfy 107#true [2019-10-13 22:56:11,979 INFO L193 IcfgInterpreter]: Reachable states at location L543 satisfy 436#true [2019-10-13 22:56:11,980 INFO L193 IcfgInterpreter]: Reachable states at location L525-3 satisfy 48#(and (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (= 0 |main_#t~malloc2.offset|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 main_~p~0.offset) (<= |main_#t~malloc2.offset| 0) (<= |#NULL.base| 0) (<= main_~p~0.offset 0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:11,980 INFO L193 IcfgInterpreter]: Reachable states at location L522 satisfy 38#(and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~a~0.offset 0) (= 0 |main_#t~malloc2.offset|) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:12,562 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-10-13 22:56:12,778 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-10-13 22:56:12,856 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:56:12,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 12] total 28 [2019-10-13 22:56:12,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064961025] [2019-10-13 22:56:12,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 22:56:12,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:12,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 22:56:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2019-10-13 22:56:12,859 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 28 states. [2019-10-13 22:56:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:14,523 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2019-10-13 22:56:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-13 22:56:14,524 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-10-13 22:56:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:14,525 INFO L225 Difference]: With dead ends: 90 [2019-10-13 22:56:14,526 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 22:56:14,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=392, Invalid=2578, Unknown=0, NotChecked=0, Total=2970 [2019-10-13 22:56:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 22:56:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 52. [2019-10-13 22:56:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 22:56:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-10-13 22:56:14,535 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 27 [2019-10-13 22:56:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:14,536 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-10-13 22:56:14,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 22:56:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-10-13 22:56:14,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 22:56:14,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:14,537 INFO L380 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-10-13 22:56:14,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:14,742 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1242894750, now seen corresponding path program 1 times [2019-10-13 22:56:14,742 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:14,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469187920] [2019-10-13 22:56:14,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:14,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:14,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:56:14,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469187920] [2019-10-13 22:56:14,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291713480] [2019-10-13 22:56:14,828 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-10-13 22:56:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:14,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 22:56:14,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:56:15,097 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:15,280 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2019-10-13 22:56:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 22:56:15,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1053393061] [2019-10-13 22:56:15,394 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:56:15,394 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:56:15,395 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:56:15,395 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:56:15,395 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:56:15,421 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 22:56:16,159 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:56:16,161 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:56:16,162 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:56:16,162 INFO L193 IcfgInterpreter]: Reachable states at location L545 satisfy 499#(and (not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= |main_#t~mem13| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:56:16,162 INFO L193 IcfgInterpreter]: Reachable states at location L525-1 satisfy 53#(and (<= |main_#t~malloc2.offset| 0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 main_~p~0.offset) (<= main_~p~0.offset 0) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (<= 0 |#NULL.base|) (<= |main_#t~nondet3| 2147483647) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (not (= main_~a~0.offset 0)) (<= |main_#t~nondet3| 2147483647) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 (+ |main_#t~nondet3| 2147483648))) [2019-10-13 22:56:16,162 INFO L193 IcfgInterpreter]: Reachable states at location L535 satisfy 345#(and (<= main_~t~0.offset 0) (<= 0 main_~t~0.offset) (<= |main_#t~malloc7.offset| 0) (<= 0 |main_#t~malloc7.offset|) (= |main_#t~malloc7.offset| 0)) [2019-10-13 22:56:16,163 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 508#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:56:16,163 INFO L193 IcfgInterpreter]: Reachable states at location L546 satisfy 489#(and (not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))) [2019-10-13 22:56:16,163 INFO L193 IcfgInterpreter]: Reachable states at location L541-3 satisfy 413#true [2019-10-13 22:56:16,163 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:16,163 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:16,164 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 513#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:16,164 INFO L193 IcfgInterpreter]: Reachable states at location L532-3 satisfy 408#true [2019-10-13 22:56:16,164 INFO L193 IcfgInterpreter]: Reachable states at location L541-1 satisfy 428#true [2019-10-13 22:56:16,164 INFO L193 IcfgInterpreter]: Reachable states at location L543-3 satisfy 504#(not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:56:16,164 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:56:16,164 INFO L193 IcfgInterpreter]: Reachable states at location L522-3 satisfy 43#(and (<= |main_#t~malloc2.offset| 0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:16,165 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 474#(and (not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))) [2019-10-13 22:56:16,165 INFO L193 IcfgInterpreter]: Reachable states at location L532-2 satisfy 115#true [2019-10-13 22:56:16,165 INFO L193 IcfgInterpreter]: Reachable states at location L543-2 satisfy 433#true [2019-10-13 22:56:16,165 INFO L193 IcfgInterpreter]: Reachable states at location L532 satisfy 123#(and (<= 0 (+ |main_#t~nondet6| 2147483648)) (<= |main_#t~nondet6| 2147483647)) [2019-10-13 22:56:16,165 INFO L193 IcfgInterpreter]: Reachable states at location L535-3 satisfy 107#true [2019-10-13 22:56:16,166 INFO L193 IcfgInterpreter]: Reachable states at location L543 satisfy 438#(= |main_#t~mem11| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2019-10-13 22:56:16,166 INFO L193 IcfgInterpreter]: Reachable states at location L525-3 satisfy 48#(and (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (= 0 |main_#t~malloc2.offset|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= main_~a~0.base main_~p~0.base) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= main_~a~0.offset main_~p~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 main_~p~0.offset) (<= |main_#t~malloc2.offset| 0) (<= |#NULL.base| 0) (<= main_~p~0.offset 0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:16,166 INFO L193 IcfgInterpreter]: Reachable states at location L522 satisfy 38#(and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~a~0.offset 0) (= 0 |main_#t~malloc2.offset|) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:16,671 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-10-13 22:56:16,880 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-10-13 22:56:16,995 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:56:16,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7, 14] total 28 [2019-10-13 22:56:16,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081116646] [2019-10-13 22:56:16,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 22:56:16,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:16,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 22:56:16,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2019-10-13 22:56:16,998 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 28 states. [2019-10-13 22:56:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:19,191 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2019-10-13 22:56:19,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-13 22:56:19,192 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-10-13 22:56:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:19,193 INFO L225 Difference]: With dead ends: 97 [2019-10-13 22:56:19,193 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 22:56:19,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=508, Invalid=3398, Unknown=0, NotChecked=0, Total=3906 [2019-10-13 22:56:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 22:56:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 59. [2019-10-13 22:56:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 22:56:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-10-13 22:56:19,203 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 27 [2019-10-13 22:56:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:19,203 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-10-13 22:56:19,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 22:56:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-10-13 22:56:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 22:56:19,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:19,205 INFO L380 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-10-13 22:56:19,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:19,409 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:19,409 INFO L82 PathProgramCache]: Analyzing trace with hash -943192798, now seen corresponding path program 1 times [2019-10-13 22:56:19,410 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:19,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294771081] [2019-10-13 22:56:19,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:19,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:19,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:19,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294771081] [2019-10-13 22:56:19,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656617700] [2019-10-13 22:56:19,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-10-13 22:56:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:19,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-13 22:56:19,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:19,990 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:20,449 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-10-13 22:56:20,616 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2019-10-13 22:56:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:20,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1767235836] [2019-10-13 22:56:20,727 INFO L162 IcfgInterpreter]: Started Sifa with 22 locations of interest [2019-10-13 22:56:20,728 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:56:20,728 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:56:20,728 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:56:20,729 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:56:20,751 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 22:56:21,015 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:56:21,135 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:56:21,137 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:56:21,138 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:56:21,138 INFO L193 IcfgInterpreter]: Reachable states at location L545 satisfy 168#(and (not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (= |main_#t~mem13| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:56:21,138 INFO L193 IcfgInterpreter]: Reachable states at location L525-1 satisfy 80#(and (<= |main_#t~nondet3| 2147483647) (<= 0 (+ |main_#t~nondet3| 2147483648))) [2019-10-13 22:56:21,138 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 187#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:56:21,138 INFO L193 IcfgInterpreter]: Reachable states at location L546 satisfy 173#(and (not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))) [2019-10-13 22:56:21,138 INFO L193 IcfgInterpreter]: Reachable states at location L528-3 satisfy 90#(and (<= main_~t~0.offset 0) (<= |main_#t~malloc4.offset| 0) (<= 0 main_~t~0.offset) (or (and (= |main_#t~malloc4.base| main_~t~0.base) (= (select |#length| |main_#t~malloc4.base|) 8) (= main_~t~0.offset |main_#t~malloc4.offset|) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= |main_#t~malloc4.base| 0)) (not (= main_~t~0.base 0)) (= 0 |main_#t~malloc4.offset|) (< |#StackHeapBarrier| |main_#t~malloc4.base|)) (and (not (= main_~t~0.offset 0)) (= |main_#t~malloc4.base| main_~t~0.base) (= (select |#length| |main_#t~malloc4.base|) 8) (= main_~t~0.offset |main_#t~malloc4.offset|) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= |main_#t~malloc4.base| 0)) (= 0 |main_#t~malloc4.offset|) (< |#StackHeapBarrier| |main_#t~malloc4.base|))) (<= 0 |main_#t~malloc4.offset|)) [2019-10-13 22:56:21,139 INFO L193 IcfgInterpreter]: Reachable states at location L541-3 satisfy 183#(or (exists ((v_main_~p~0.base_127 Int) (v_main_~p~0.offset_127 Int)) (and (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_127) (+ v_main_~p~0.offset_127 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_main_~p~0.base_127) (+ v_main_~p~0.offset_127 4))))) (exists ((v_main_~p~0.base_123 Int) (v_main_~p~0.offset_123 Int)) (and (= main_~a~0.base main_~p~0.base) (= (select (select |#memory_int| v_main_~p~0.base_123) v_main_~p~0.offset_123) 3) (= main_~a~0.offset main_~p~0.offset)))) [2019-10-13 22:56:21,139 INFO L193 IcfgInterpreter]: Reachable states at location L528 satisfy 85#(and (<= main_~t~0.offset 0) (<= |main_#t~malloc4.offset| 0) (<= 0 main_~t~0.offset) (= |main_#t~malloc4.base| main_~t~0.base) (= (select |#length| |main_#t~malloc4.base|) 8) (= main_~t~0.offset |main_#t~malloc4.offset|) (= 1 (select |#valid| |main_#t~malloc4.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= |main_#t~malloc4.base| 0)) (= 0 |main_#t~malloc4.offset|) (< |#StackHeapBarrier| |main_#t~malloc4.base|) (<= 0 |main_#t~malloc4.offset|)) [2019-10-13 22:56:21,139 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:21,139 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:21,139 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 192#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:21,139 INFO L193 IcfgInterpreter]: Reachable states at location L532-3 satisfy 105#true [2019-10-13 22:56:21,140 INFO L193 IcfgInterpreter]: Reachable states at location L541-1 satisfy 148#true [2019-10-13 22:56:21,140 INFO L193 IcfgInterpreter]: Reachable states at location L543-3 satisfy 163#(not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-10-13 22:56:21,140 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:56:21,140 INFO L193 IcfgInterpreter]: Reachable states at location L522-3 satisfy 43#(and (<= |main_#t~malloc2.offset| 0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (or (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.base|) (not (= main_~a~0.offset 0)) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (= 0 |main_#t~malloc2.offset|) (not (= 0 main_~a~0.base)) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 22:56:21,140 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 178#(and (not (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (not (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))) [2019-10-13 22:56:21,141 INFO L193 IcfgInterpreter]: Reachable states at location L532-2 satisfy 95#true [2019-10-13 22:56:21,141 INFO L193 IcfgInterpreter]: Reachable states at location L543-2 satisfy 153#true [2019-10-13 22:56:21,141 INFO L193 IcfgInterpreter]: Reachable states at location L532 satisfy 100#(and (<= 0 (+ |main_#t~nondet6| 2147483648)) (<= |main_#t~nondet6| 2147483647)) [2019-10-13 22:56:21,141 INFO L193 IcfgInterpreter]: Reachable states at location L543 satisfy 158#(= |main_#t~mem11| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) [2019-10-13 22:56:21,141 INFO L193 IcfgInterpreter]: Reachable states at location L525-3 satisfy 75#true [2019-10-13 22:56:21,141 INFO L193 IcfgInterpreter]: Reachable states at location L522 satisfy 38#(and (= (store |old(#length)| |main_#t~malloc2.base| 8) |#length|) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= main_~a~0.offset 0) (= 0 |main_#t~malloc2.offset|) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |main_#t~malloc2.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= main_~a~0.offset |main_#t~malloc2.offset|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 22:56:21,793 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:56:21,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 14] total 33 [2019-10-13 22:56:21,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330567239] [2019-10-13 22:56:21,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-13 22:56:21,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:56:21,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-13 22:56:21,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 22:56:21,796 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 33 states. [2019-10-13 22:56:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:56:23,982 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-10-13 22:56:23,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 22:56:23,983 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 27 [2019-10-13 22:56:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:56:23,984 INFO L225 Difference]: With dead ends: 73 [2019-10-13 22:56:23,985 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 22:56:23,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=397, Invalid=2909, Unknown=0, NotChecked=0, Total=3306 [2019-10-13 22:56:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 22:56:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2019-10-13 22:56:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-13 22:56:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-10-13 22:56:23,992 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 27 [2019-10-13 22:56:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:56:23,993 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-10-13 22:56:23,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-13 22:56:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-10-13 22:56:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 22:56:23,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:56:23,994 INFO L380 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-10-13 22:56:24,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:24,201 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:56:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:56:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2010882898, now seen corresponding path program 3 times [2019-10-13 22:56:24,202 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:56:24,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069342080] [2019-10-13 22:56:24,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:24,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:56:24,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:56:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:56:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:24,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069342080] [2019-10-13 22:56:24,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193733573] [2019-10-13 22:56:24,456 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:56:24,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:56:24,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:56:24,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-13 22:56:24,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:56:25,368 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-13 22:56:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:56:26,236 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:56:29,583 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 185 DAG size of output: 79