java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/list_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:22:05,867 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:22:05,869 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:22:05,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:22:05,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:22:05,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:22:05,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:22:05,886 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:22:05,888 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:22:05,889 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:22:05,889 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:22:05,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:22:05,891 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:22:05,892 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:22:05,893 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:22:05,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:22:05,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:22:05,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:22:05,898 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:22:05,900 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:22:05,901 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:22:05,902 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:22:05,905 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:22:05,905 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:22:05,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:22:05,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:22:05,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:22:05,908 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:22:05,909 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:22:05,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:22:05,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:22:05,911 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:22:05,912 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:22:05,912 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:22:05,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:22:05,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:22:05,914 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:22:05,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:22:05,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:22:05,949 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:22:05,949 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:22:05,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:22:05,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:22:05,950 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:22:05,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:22:05,951 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:22:05,951 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:22:05,951 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:22:05,951 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:22:05,951 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:22:05,952 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:22:05,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:22:05,953 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:22:05,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:22:05,953 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:22:05,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:22:05,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:22:05,954 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:22:05,954 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:22:05,954 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:22:05,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:22:05,955 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:22:05,955 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:22:05,955 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:22:05,955 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:22:05,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:22:05,956 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:22:06,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:22:06,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:22:06,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:22:06,050 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:22:06,050 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:22:06,051 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:06,118 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03164362b/e5c4eb600f8c459eaec61117a34d09a5/FLAG5f400d05a [2018-11-14 17:22:06,695 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:22:06,696 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:06,710 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03164362b/e5c4eb600f8c459eaec61117a34d09a5/FLAG5f400d05a [2018-11-14 17:22:06,727 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03164362b/e5c4eb600f8c459eaec61117a34d09a5 [2018-11-14 17:22:06,737 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:22:06,739 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:22:06,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:06,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:22:06,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:22:06,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:06" (1/1) ... [2018-11-14 17:22:06,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718d4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:06, skipping insertion in model container [2018-11-14 17:22:06,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:06" (1/1) ... [2018-11-14 17:22:06,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:22:06,809 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:22:07,178 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:07,193 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:22:07,283 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:07,358 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:22:07,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:07 WrapperNode [2018-11-14 17:22:07,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:07,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:22:07,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:22:07,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:22:07,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:07" (1/1) ... [2018-11-14 17:22:07,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:07" (1/1) ... [2018-11-14 17:22:07,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:07" (1/1) ... [2018-11-14 17:22:07,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:07" (1/1) ... [2018-11-14 17:22:07,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:07" (1/1) ... [2018-11-14 17:22:07,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:07" (1/1) ... [2018-11-14 17:22:07,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:07" (1/1) ... [2018-11-14 17:22:07,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:22:07,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:22:07,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:22:07,518 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:22:07,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:07" (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 [2018-11-14 17:22:07,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:22:07,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:22:07,602 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 17:22:07,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:22:07,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:22:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:22:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:22:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:22:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:22:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:22:07,603 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:22:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:22:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:22:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:22:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:22:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:22:07,604 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:22:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:22:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:22:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:22:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:22:07,605 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:22:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:22:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:22:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:22:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:22:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:22:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:22:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:22:07,607 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:22:07,607 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:22:07,607 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:22:07,607 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:22:07,607 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:22:07,607 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:22:07,607 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:22:07,608 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:22:07,608 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:22:07,608 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:22:07,608 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:22:07,608 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:22:07,608 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:22:07,608 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:22:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:22:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:22:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:22:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:22:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:22:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:22:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:22:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:22:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:22:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:22:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:22:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:22:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:22:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:22:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:22:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:22:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:22:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:22:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:22:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:22:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:22:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:22:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:22:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:22:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:22:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:22:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:22:07,612 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-14 17:22:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:22:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:22:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:22:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:22:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:22:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:22:07,613 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:22:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:22:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:22:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:22:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:22:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:22:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:22:07,614 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:22:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:22:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:22:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:22:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:22:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:22:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:22:07,615 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:22:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:22:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:22:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:22:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:22:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:22:07,616 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:22:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:22:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:22:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:22:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:22:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:22:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:22:07,618 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:22:07,618 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:22:07,618 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:22:07,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:22:07,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:22:07,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:22:07,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:22:07,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:22:07,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:22:07,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:22:07,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:22:07,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:22:07,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:22:08,584 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:22:08,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:08 BoogieIcfgContainer [2018-11-14 17:22:08,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:22:08,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:22:08,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:22:08,589 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:22:08,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:22:06" (1/3) ... [2018-11-14 17:22:08,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70093491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:08, skipping insertion in model container [2018-11-14 17:22:08,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:07" (2/3) ... [2018-11-14 17:22:08,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70093491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:08, skipping insertion in model container [2018-11-14 17:22:08,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:08" (3/3) ... [2018-11-14 17:22:08,594 INFO L112 eAbstractionObserver]: Analyzing ICFG list_false-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:08,605 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:22:08,616 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:22:08,635 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:22:08,678 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:22:08,679 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:22:08,679 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:22:08,679 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:22:08,680 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:22:08,680 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:22:08,681 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:22:08,681 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:22:08,681 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:22:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-14 17:22:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:22:08,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:08,708 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:08,711 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:08,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1995892254, now seen corresponding path program 1 times [2018-11-14 17:22:08,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:08,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:08,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:08,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:08,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:08,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2018-11-14 17:22:08,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {42#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42#true} is VALID [2018-11-14 17:22:08,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-14 17:22:08,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #108#return; {42#true} is VALID [2018-11-14 17:22:08,900 INFO L256 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret12 := main(); {42#true} is VALID [2018-11-14 17:22:08,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {42#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {42#true} is VALID [2018-11-14 17:22:08,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {42#true} is VALID [2018-11-14 17:22:08,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {42#true} is VALID [2018-11-14 17:22:08,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {42#true} assume !true; {43#false} is VALID [2018-11-14 17:22:08,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#false} assume !true; {43#false} is VALID [2018-11-14 17:22:08,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {43#false} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {43#false} is VALID [2018-11-14 17:22:08,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {43#false} assume !true; {43#false} is VALID [2018-11-14 17:22:08,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2018-11-14 17:22:08,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {43#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4); {43#false} is VALID [2018-11-14 17:22:08,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {43#false} assume #t~mem11 != 3;havoc #t~mem11; {43#false} is VALID [2018-11-14 17:22:08,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {43#false} assume !false; {43#false} is VALID [2018-11-14 17:22:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:08,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:08,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:22:08,929 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:22:08,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:08,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:22:09,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:09,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:22:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:22:09,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:22:09,109 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-14 17:22:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:09,214 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2018-11-14 17:22:09,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:22:09,215 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:22:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:22:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-14 17:22:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:22:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-14 17:22:09,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-14 17:22:09,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:09,747 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:22:09,747 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:22:09,751 INFO L604 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 [2018-11-14 17:22:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:22:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:22:09,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:09,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:22:09,792 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:22:09,792 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:22:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:09,797 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 17:22:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 17:22:09,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:09,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:09,798 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:22:09,799 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:22:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:09,803 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 17:22:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 17:22:09,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:09,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:09,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:09,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:22:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-14 17:22:09,809 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 16 [2018-11-14 17:22:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:09,810 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-14 17:22:09,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:22:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 17:22:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:22:09,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:09,811 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:09,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:09,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash -269117598, now seen corresponding path program 1 times [2018-11-14 17:22:09,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:09,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:09,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:10,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-14 17:22:10,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {215#true} is VALID [2018-11-14 17:22:10,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:22:10,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #108#return; {215#true} is VALID [2018-11-14 17:22:10,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret12 := main(); {215#true} is VALID [2018-11-14 17:22:10,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {215#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {215#true} is VALID [2018-11-14 17:22:10,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {215#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {215#true} is VALID [2018-11-14 17:22:10,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {215#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:10,049 INFO L273 TraceCheckUtils]: 8: Hoare triple {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:10,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:10,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:10,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:10,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:10,075 INFO L273 TraceCheckUtils]: 13: Hoare triple {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:10,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {217#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:10,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:10,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4); {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:10,091 INFO L273 TraceCheckUtils]: 17: Hoare triple {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem7 == 2);havoc #t~mem7; {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:10,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:10,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 0, 4); {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:10,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem9 == 1);havoc #t~mem9; {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:10,095 INFO L273 TraceCheckUtils]: 21: Hoare triple {218#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4); {219#(= 3 |main_#t~mem11|)} is VALID [2018-11-14 17:22:10,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {219#(= 3 |main_#t~mem11|)} assume #t~mem11 != 3;havoc #t~mem11; {216#false} is VALID [2018-11-14 17:22:10,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-14 17:22:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:10,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:10,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:22:10,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-14 17:22:10,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:10,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:22:10,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:10,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:22:10,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:22:10,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:22:10,158 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-11-14 17:22:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:10,753 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-14 17:22:10,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:22:10,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-14 17:22:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-14 17:22:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-14 17:22:10,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2018-11-14 17:22:10,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:10,873 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:22:10,874 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 17:22:10,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:22:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 17:22:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2018-11-14 17:22:10,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:10,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 42 states. [2018-11-14 17:22:10,901 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 42 states. [2018-11-14 17:22:10,901 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 42 states. [2018-11-14 17:22:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:10,906 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-14 17:22:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-14 17:22:10,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:10,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:10,907 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 56 states. [2018-11-14 17:22:10,907 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 56 states. [2018-11-14 17:22:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:10,911 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-14 17:22:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-14 17:22:10,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:10,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:10,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:10,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:22:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-14 17:22:10,916 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 24 [2018-11-14 17:22:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:10,917 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-14 17:22:10,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:22:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 17:22:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:22:10,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:10,918 INFO L375 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, 1, 1] [2018-11-14 17:22:10,919 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:10,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1424625438, now seen corresponding path program 1 times [2018-11-14 17:22:10,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:10,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:10,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:10,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:10,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:11,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2018-11-14 17:22:11,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {457#true} is VALID [2018-11-14 17:22:11,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-14 17:22:11,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #108#return; {457#true} is VALID [2018-11-14 17:22:11,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret12 := main(); {457#true} is VALID [2018-11-14 17:22:11,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {457#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {457#true} is VALID [2018-11-14 17:22:11,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {457#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {457#true} is VALID [2018-11-14 17:22:11,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {457#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {459#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {460#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 17:22:11,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {460#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume true; {460#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 17:22:11,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {460#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4); {460#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 17:22:11,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {460#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume !(#t~mem7 == 2);havoc #t~mem7; {460#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 17:22:11,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {460#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume true; {460#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 17:22:11,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {460#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 0, 4); {461#(= |main_#t~mem9| 3)} is VALID [2018-11-14 17:22:11,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {461#(= |main_#t~mem9| 3)} assume !!(#t~mem9 == 1);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {458#false} is VALID [2018-11-14 17:22:11,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {458#false} assume true; {458#false} is VALID [2018-11-14 17:22:11,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {458#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 0, 4); {458#false} is VALID [2018-11-14 17:22:11,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {458#false} assume !(#t~mem9 == 1);havoc #t~mem9; {458#false} is VALID [2018-11-14 17:22:11,091 INFO L273 TraceCheckUtils]: 24: Hoare triple {458#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4); {458#false} is VALID [2018-11-14 17:22:11,091 INFO L273 TraceCheckUtils]: 25: Hoare triple {458#false} assume #t~mem11 != 3;havoc #t~mem11; {458#false} is VALID [2018-11-14 17:22:11,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {458#false} assume !false; {458#false} is VALID [2018-11-14 17:22:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:11,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:11,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:22:11,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:22:11,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:11,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:22:11,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:11,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:22:11,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:22:11,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:22:11,165 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-14 17:22:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:11,521 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-14 17:22:11,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:22:11,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:22:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-14 17:22:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-14 17:22:11,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2018-11-14 17:22:11,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:11,671 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:22:11,671 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 17:22:11,672 INFO L604 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 [2018-11-14 17:22:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 17:22:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2018-11-14 17:22:11,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:11,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 39 states. [2018-11-14 17:22:11,716 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 39 states. [2018-11-14 17:22:11,717 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 39 states. [2018-11-14 17:22:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:11,720 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-14 17:22:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-14 17:22:11,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:11,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:11,722 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 53 states. [2018-11-14 17:22:11,722 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 53 states. [2018-11-14 17:22:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:11,726 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-14 17:22:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-14 17:22:11,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:11,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:11,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:11,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:22:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-14 17:22:11,731 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2018-11-14 17:22:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:11,731 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-14 17:22:11,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:22:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 17:22:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:22:11,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:11,733 INFO L375 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, 1, 1] [2018-11-14 17:22:11,733 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:11,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:11,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1404932111, now seen corresponding path program 1 times [2018-11-14 17:22:11,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:11,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:11,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:11,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:11,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:11,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2018-11-14 17:22:11,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {693#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {693#true} is VALID [2018-11-14 17:22:11,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {693#true} assume true; {693#true} is VALID [2018-11-14 17:22:11,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {693#true} {693#true} #108#return; {693#true} is VALID [2018-11-14 17:22:11,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {693#true} call #t~ret12 := main(); {693#true} is VALID [2018-11-14 17:22:11,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {693#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {693#true} is VALID [2018-11-14 17:22:11,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {693#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {693#true} is VALID [2018-11-14 17:22:11,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {693#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:11,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {695#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {696#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 17:22:11,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {696#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume true; {696#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 17:22:11,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {696#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4); {697#(= |main_#t~mem7| 3)} is VALID [2018-11-14 17:22:11,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {697#(= |main_#t~mem7| 3)} assume !!(#t~mem7 == 2);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {694#false} is VALID [2018-11-14 17:22:11,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {694#false} assume true; {694#false} is VALID [2018-11-14 17:22:11,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {694#false} call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4); {694#false} is VALID [2018-11-14 17:22:11,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {694#false} assume !(#t~mem7 == 2);havoc #t~mem7; {694#false} is VALID [2018-11-14 17:22:11,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {694#false} assume true; {694#false} is VALID [2018-11-14 17:22:11,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {694#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 0, 4); {694#false} is VALID [2018-11-14 17:22:11,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {694#false} assume !(#t~mem9 == 1);havoc #t~mem9; {694#false} is VALID [2018-11-14 17:22:11,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {694#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4); {694#false} is VALID [2018-11-14 17:22:11,871 INFO L273 TraceCheckUtils]: 25: Hoare triple {694#false} assume #t~mem11 != 3;havoc #t~mem11; {694#false} is VALID [2018-11-14 17:22:11,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {694#false} assume !false; {694#false} is VALID [2018-11-14 17:22:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:11,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:11,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:22:11,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:22:11,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:11,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:22:11,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:11,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:22:11,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:22:11,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:22:11,918 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-11-14 17:22:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:12,204 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-14 17:22:12,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:22:12,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 17:22:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-14 17:22:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-14 17:22:12,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2018-11-14 17:22:12,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:12,414 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:22:12,414 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 17:22:12,415 INFO L604 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 [2018-11-14 17:22:12,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 17:22:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2018-11-14 17:22:12,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:12,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 35 states. [2018-11-14 17:22:12,426 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 35 states. [2018-11-14 17:22:12,426 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 35 states. [2018-11-14 17:22:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:12,429 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-14 17:22:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-14 17:22:12,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:12,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:12,430 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 49 states. [2018-11-14 17:22:12,430 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 49 states. [2018-11-14 17:22:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:12,433 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-14 17:22:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-14 17:22:12,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:12,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:12,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:12,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:22:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 17:22:12,436 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2018-11-14 17:22:12,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:12,437 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 17:22:12,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:22:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 17:22:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 17:22:12,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:12,438 INFO L375 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, 1, 1, 1, 1] [2018-11-14 17:22:12,438 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:12,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1952686310, now seen corresponding path program 1 times [2018-11-14 17:22:12,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:12,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:12,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:12,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:12,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:12,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {917#true} is VALID [2018-11-14 17:22:12,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {917#true} is VALID [2018-11-14 17:22:12,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2018-11-14 17:22:12,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #108#return; {917#true} is VALID [2018-11-14 17:22:12,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret12 := main(); {917#true} is VALID [2018-11-14 17:22:12,653 INFO L273 TraceCheckUtils]: 5: Hoare triple {917#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {919#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:12,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {919#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {919#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:12,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {919#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(#t~nondet4 != 0);havoc #t~nondet4;call write~int(2, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {921#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {921#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {921#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:12,666 INFO L273 TraceCheckUtils]: 15: Hoare triple {921#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 4, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {922#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:12,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {922#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume true; {922#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:12,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {922#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {922#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:12,669 INFO L273 TraceCheckUtils]: 18: Hoare triple {922#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {922#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:12,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {922#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {923#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:12,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {923#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {923#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:12,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {923#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4); {924#(= |main_#t~mem7| 2)} is VALID [2018-11-14 17:22:12,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {924#(= |main_#t~mem7| 2)} assume !(#t~mem7 == 2);havoc #t~mem7; {918#false} is VALID [2018-11-14 17:22:12,674 INFO L273 TraceCheckUtils]: 23: Hoare triple {918#false} assume true; {918#false} is VALID [2018-11-14 17:22:12,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {918#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 0, 4); {918#false} is VALID [2018-11-14 17:22:12,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {918#false} assume !(#t~mem9 == 1);havoc #t~mem9; {918#false} is VALID [2018-11-14 17:22:12,675 INFO L273 TraceCheckUtils]: 26: Hoare triple {918#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4); {918#false} is VALID [2018-11-14 17:22:12,675 INFO L273 TraceCheckUtils]: 27: Hoare triple {918#false} assume #t~mem11 != 3;havoc #t~mem11; {918#false} is VALID [2018-11-14 17:22:12,676 INFO L273 TraceCheckUtils]: 28: Hoare triple {918#false} assume !false; {918#false} is VALID [2018-11-14 17:22:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:12,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:12,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:12,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:12,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:12,856 INFO L477 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 [2018-11-14 17:22:12,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:12,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:12,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-14 17:22:12,879 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:12,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:22:12,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:22:12,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 17:22:12,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:13,035 INFO L477 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 11 treesize of output 8 [2018-11-14 17:22:13,077 INFO L477 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 8 treesize of output 7 [2018-11-14 17:22:13,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:13,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:13,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:13,133 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-14 17:22:13,136 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:13,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 17:22:13,408 INFO L477 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 8 treesize of output 7 [2018-11-14 17:22:13,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:13,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:13,427 INFO L267 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. [2018-11-14 17:22:13,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-14 17:22:13,432 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:13,503 INFO L477 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 20 [2018-11-14 17:22:13,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 17:22:13,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:13,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-14 17:22:13,535 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:13,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:13,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:13,545 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-14 17:22:13,546 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:13,594 INFO L256 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {917#true} is VALID [2018-11-14 17:22:13,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {917#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {917#true} is VALID [2018-11-14 17:22:13,595 INFO L273 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2018-11-14 17:22:13,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #108#return; {917#true} is VALID [2018-11-14 17:22:13,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret12 := main(); {917#true} is VALID [2018-11-14 17:22:13,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {917#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {919#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:13,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {919#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {919#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:13,597 INFO L273 TraceCheckUtils]: 7: Hoare triple {919#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,619 INFO L273 TraceCheckUtils]: 12: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {920#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(#t~nondet4 != 0);havoc #t~nondet4;call write~int(2, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {921#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {921#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {921#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:13,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {921#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 4, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {973#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:13,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {973#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {973#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:13,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {973#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {973#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:13,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {973#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {973#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:13,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {973#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {986#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} is VALID [2018-11-14 17:22:13,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {986#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} assume true; {986#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} is VALID [2018-11-14 17:22:13,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {986#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4); {924#(= |main_#t~mem7| 2)} is VALID [2018-11-14 17:22:13,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {924#(= |main_#t~mem7| 2)} assume !(#t~mem7 == 2);havoc #t~mem7; {918#false} is VALID [2018-11-14 17:22:13,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {918#false} assume true; {918#false} is VALID [2018-11-14 17:22:13,631 INFO L273 TraceCheckUtils]: 24: Hoare triple {918#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 0, 4); {918#false} is VALID [2018-11-14 17:22:13,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {918#false} assume !(#t~mem9 == 1);havoc #t~mem9; {918#false} is VALID [2018-11-14 17:22:13,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {918#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4); {918#false} is VALID [2018-11-14 17:22:13,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {918#false} assume #t~mem11 != 3;havoc #t~mem11; {918#false} is VALID [2018-11-14 17:22:13,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {918#false} assume !false; {918#false} is VALID [2018-11-14 17:22:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:13,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:22:13,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-14 17:22:13,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-14 17:22:13,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:13,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:22:13,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:13,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:22:13,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:22:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:22:13,722 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 10 states. [2018-11-14 17:22:14,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:14,746 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-11-14 17:22:14,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:22:14,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-14 17:22:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-14 17:22:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-14 17:22:14,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2018-11-14 17:22:14,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:14,912 INFO L225 Difference]: With dead ends: 65 [2018-11-14 17:22:14,912 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:22:14,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:22:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:22:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2018-11-14 17:22:14,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:14,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 44 states. [2018-11-14 17:22:14,949 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 44 states. [2018-11-14 17:22:14,949 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 44 states. [2018-11-14 17:22:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:14,953 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-14 17:22:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-14 17:22:14,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:14,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:14,954 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 58 states. [2018-11-14 17:22:14,954 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 58 states. [2018-11-14 17:22:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:14,956 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-14 17:22:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-14 17:22:14,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:14,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:14,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:14,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:22:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-14 17:22:14,960 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 29 [2018-11-14 17:22:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:14,960 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-14 17:22:14,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:22:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 17:22:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 17:22:14,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:14,961 INFO L375 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, 1, 1, 1, 1] [2018-11-14 17:22:14,962 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:14,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash 614296739, now seen corresponding path program 1 times [2018-11-14 17:22:14,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:14,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:14,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:14,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:15,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {1267#true} call ULTIMATE.init(); {1267#true} is VALID [2018-11-14 17:22:15,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {1267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1267#true} is VALID [2018-11-14 17:22:15,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {1267#true} assume true; {1267#true} is VALID [2018-11-14 17:22:15,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1267#true} {1267#true} #108#return; {1267#true} is VALID [2018-11-14 17:22:15,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {1267#true} call #t~ret12 := main(); {1267#true} is VALID [2018-11-14 17:22:15,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {1267#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1269#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:15,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {1269#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1269#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:15,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {1269#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:15,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:15,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:15,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(#t~nondet1 != 0);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1271#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:15,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {1271#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1271#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:15,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {1271#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 4, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:15,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume true; {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:15,149 INFO L273 TraceCheckUtils]: 14: Hoare triple {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:15,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:15,150 INFO L273 TraceCheckUtils]: 16: Hoare triple {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume true; {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:15,151 INFO L273 TraceCheckUtils]: 17: Hoare triple {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:15,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:22:15,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {1272#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1273#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:15,154 INFO L273 TraceCheckUtils]: 20: Hoare triple {1273#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {1273#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:15,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {1273#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1273#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:15,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {1273#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem7 == 2);havoc #t~mem7; {1273#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:15,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {1273#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {1273#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:22:15,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {1273#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1274#(= |main_#t~mem9| 1)} is VALID [2018-11-14 17:22:15,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {1274#(= |main_#t~mem9| 1)} assume !(#t~mem9 == 1);havoc #t~mem9; {1268#false} is VALID [2018-11-14 17:22:15,158 INFO L273 TraceCheckUtils]: 26: Hoare triple {1268#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1268#false} is VALID [2018-11-14 17:22:15,158 INFO L273 TraceCheckUtils]: 27: Hoare triple {1268#false} assume #t~mem11 != 3;havoc #t~mem11; {1268#false} is VALID [2018-11-14 17:22:15,158 INFO L273 TraceCheckUtils]: 28: Hoare triple {1268#false} assume !false; {1268#false} is VALID [2018-11-14 17:22:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:15,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:15,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:15,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:15,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:15,272 INFO L477 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 [2018-11-14 17:22:15,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-14 17:22:15,283 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:15,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:22:15,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:22:15,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 17:22:15,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,549 INFO L477 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 11 treesize of output 8 [2018-11-14 17:22:15,559 INFO L477 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 8 treesize of output 7 [2018-11-14 17:22:15,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,600 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-14 17:22:15,603 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:15,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 17:22:15,735 INFO L477 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 8 treesize of output 7 [2018-11-14 17:22:15,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,754 INFO L267 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. [2018-11-14 17:22:15,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-14 17:22:15,758 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:15,863 INFO L477 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 20 [2018-11-14 17:22:15,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 17:22:15,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-14 17:22:15,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:15,900 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-14 17:22:15,902 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:15,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {1267#true} call ULTIMATE.init(); {1267#true} is VALID [2018-11-14 17:22:15,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {1267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1267#true} is VALID [2018-11-14 17:22:15,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {1267#true} assume true; {1267#true} is VALID [2018-11-14 17:22:15,916 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1267#true} {1267#true} #108#return; {1267#true} is VALID [2018-11-14 17:22:15,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {1267#true} call #t~ret12 := main(); {1267#true} is VALID [2018-11-14 17:22:15,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {1267#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1269#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:15,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {1269#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1269#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:22:15,918 INFO L273 TraceCheckUtils]: 7: Hoare triple {1269#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:15,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:15,919 INFO L273 TraceCheckUtils]: 9: Hoare triple {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:15,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {1270#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(#t~nondet1 != 0);havoc #t~nondet1;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1271#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:15,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {1271#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1271#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:22:15,980 INFO L273 TraceCheckUtils]: 12: Hoare triple {1271#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 4, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:15,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:16,008 INFO L273 TraceCheckUtils]: 14: Hoare triple {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:16,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:16,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:16,050 INFO L273 TraceCheckUtils]: 17: Hoare triple {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:16,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet4 != 0);havoc #t~nondet4; {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:22:16,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {1314#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1336#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-14 17:22:16,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {1336#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} assume true; {1336#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-14 17:22:16,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {1336#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1336#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-14 17:22:16,057 INFO L273 TraceCheckUtils]: 22: Hoare triple {1336#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} assume !(#t~mem7 == 2);havoc #t~mem7; {1336#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-14 17:22:16,065 INFO L273 TraceCheckUtils]: 23: Hoare triple {1336#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} assume true; {1336#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-14 17:22:16,066 INFO L273 TraceCheckUtils]: 24: Hoare triple {1336#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1274#(= |main_#t~mem9| 1)} is VALID [2018-11-14 17:22:16,067 INFO L273 TraceCheckUtils]: 25: Hoare triple {1274#(= |main_#t~mem9| 1)} assume !(#t~mem9 == 1);havoc #t~mem9; {1268#false} is VALID [2018-11-14 17:22:16,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {1268#false} call #t~mem11 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1268#false} is VALID [2018-11-14 17:22:16,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {1268#false} assume #t~mem11 != 3;havoc #t~mem11; {1268#false} is VALID [2018-11-14 17:22:16,067 INFO L273 TraceCheckUtils]: 28: Hoare triple {1268#false} assume !false; {1268#false} is VALID [2018-11-14 17:22:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:22:16,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:22:16,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-14 17:22:16,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-14 17:22:16,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:16,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:22:16,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:16,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:22:16,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:22:16,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:22:16,202 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-11-14 17:22:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:17,481 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-11-14 17:22:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:22:17,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-14 17:22:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2018-11-14 17:22:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 78 transitions. [2018-11-14 17:22:17,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 78 transitions. [2018-11-14 17:22:17,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:17,585 INFO L225 Difference]: With dead ends: 77 [2018-11-14 17:22:17,585 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 17:22:17,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:22:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 17:22:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2018-11-14 17:22:17,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:17,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 59 states. [2018-11-14 17:22:17,626 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 59 states. [2018-11-14 17:22:17,626 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 59 states. [2018-11-14 17:22:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:17,630 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-14 17:22:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-14 17:22:17,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:17,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:17,631 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 73 states. [2018-11-14 17:22:17,631 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 73 states. [2018-11-14 17:22:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:17,634 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-14 17:22:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-14 17:22:17,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:17,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:17,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:17,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 17:22:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-11-14 17:22:17,637 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 29 [2018-11-14 17:22:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:17,638 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-14 17:22:17,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:22:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-14 17:22:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:22:17,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:17,639 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:17,639 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:17,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:17,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1385707539, now seen corresponding path program 1 times [2018-11-14 17:22:17,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:17,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:17,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:17,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:17,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:17,840 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 17:22:17,844 INFO L168 Benchmark]: Toolchain (without parser) took 11106.14 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 863.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.2 MB). Peak memory consumption was 111.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:17,846 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:22:17,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:17,847 INFO L168 Benchmark]: Boogie Preprocessor took 158.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:17,848 INFO L168 Benchmark]: RCFGBuilder took 1067.17 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:17,850 INFO L168 Benchmark]: TraceAbstraction took 9257.32 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 154.1 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -57.7 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:17,854 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 618.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 158.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1067.17 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9257.32 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 154.1 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -57.7 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...