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_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-circular_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:14:51,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:14:51,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:14:51,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:14:51,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:14:51,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:14:51,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:14:51,056 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:14:51,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:14:51,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:14:51,069 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:14:51,069 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:14:51,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:14:51,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:14:51,074 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:14:51,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:14:51,076 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:14:51,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:14:51,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:14:51,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:14:51,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:14:51,093 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:14:51,096 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:14:51,096 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:14:51,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:14:51,100 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:14:51,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:14:51,101 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:14:51,103 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:14:51,104 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:14:51,104 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:14:51,107 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:14:51,108 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:14:51,108 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:14:51,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:14:51,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:14:51,112 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:14:51,132 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:14:51,132 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:14:51,133 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:14:51,133 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:14:51,134 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:14:51,134 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:14:51,135 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:14:51,135 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:14:51,135 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:14:51,135 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:14:51,135 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:14:51,136 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:14:51,136 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:14:51,136 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:14:51,136 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:14:51,136 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:14:51,137 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:14:51,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:14:51,137 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:14:51,137 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:14:51,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:14:51,138 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:14:51,138 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:14:51,138 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:14:51,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:14:51,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:14:51,139 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:14:51,139 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:14:51,139 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:14:51,139 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:14:51,139 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:14:51,140 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:14:51,140 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:14:51,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:14:51,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:14:51,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:14:51,226 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:14:51,226 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:14:51,227 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_false-unreach-call_false-valid-memcleanup.i [2018-11-14 18:14:51,308 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabe721c5/976610bbd0af4fb887c8e1dbeae32a56/FLAGd875fe48d [2018-11-14 18:14:51,833 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:14:51,834 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular_false-unreach-call_false-valid-memcleanup.i [2018-11-14 18:14:51,863 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabe721c5/976610bbd0af4fb887c8e1dbeae32a56/FLAGd875fe48d [2018-11-14 18:14:51,885 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabe721c5/976610bbd0af4fb887c8e1dbeae32a56 [2018-11-14 18:14:51,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:14:51,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:14:51,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:14:51,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:14:51,903 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:14:51,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:14:51" (1/1) ... [2018-11-14 18:14:51,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340f7487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:51, skipping insertion in model container [2018-11-14 18:14:51,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:14:51" (1/1) ... [2018-11-14 18:14:51,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:14:51,968 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:14:52,338 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:14:52,353 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:14:52,423 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:14:52,575 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:14:52,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:52 WrapperNode [2018-11-14 18:14:52,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:14:52,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:14:52,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:14:52,577 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:14:52,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:52" (1/1) ... [2018-11-14 18:14:52,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:52" (1/1) ... [2018-11-14 18:14:52,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:52" (1/1) ... [2018-11-14 18:14:52,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:52" (1/1) ... [2018-11-14 18:14:52,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:52" (1/1) ... [2018-11-14 18:14:52,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:52" (1/1) ... [2018-11-14 18:14:52,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:52" (1/1) ... [2018-11-14 18:14:52,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:14:52,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:14:52,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:14:52,681 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:14:52,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:52" (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 18:14:52,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:14:52,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:14:52,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:14:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:14:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:14:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:14:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:14:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:14:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:14:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:14:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:14:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:14:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:14:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:14:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:14:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:14:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:14:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:14:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:14:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:14:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:14:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:14:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:14:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:14:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:14:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:14:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:14:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:14:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:14:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:14:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:14:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:14:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:14:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:14:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:14:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:14:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:14:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:14:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:14:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:14:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:14:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:14:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:14:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:14:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:14:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:14:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:14:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:14:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:14:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:14:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:14:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:14:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:14:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:14:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:14:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:14:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:14:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:14:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:14:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:14:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:14:52,755 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:14:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:14:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:14:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:14:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:14:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:14:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:14:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:14:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:14:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:14:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:14:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:14:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:14:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:14:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:14:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:14:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:14:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:14:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:14:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:14:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:14:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:14:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:14:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:14:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:14:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:14:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:14:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:14:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:14:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:14:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:14:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:14:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:14:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:14:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:14:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:14:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:14:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:14:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:14:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:14:52,761 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:14:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:14:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:14:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:14:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:14:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:14:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:14:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:14:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:14:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:14:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:14:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:14:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:14:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:14:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:14:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:14:52,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:14:53,905 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:14:53,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:14:53 BoogieIcfgContainer [2018-11-14 18:14:53,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:14:53,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:14:53,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:14:53,910 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:14:53,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:14:51" (1/3) ... [2018-11-14 18:14:53,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c13dc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:14:53, skipping insertion in model container [2018-11-14 18:14:53,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:52" (2/3) ... [2018-11-14 18:14:53,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c13dc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:14:53, skipping insertion in model container [2018-11-14 18:14:53,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:14:53" (3/3) ... [2018-11-14 18:14:53,913 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular_false-unreach-call_false-valid-memcleanup.i [2018-11-14 18:14:53,921 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:14:53,932 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-14 18:14:53,952 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-14 18:14:53,995 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:14:53,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:14:53,996 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:14:53,996 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:14:53,996 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:14:53,996 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:14:53,996 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:14:53,996 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:14:53,997 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:14:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 18:14:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:14:54,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:54,028 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:54,031 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:54,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:54,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1513764545, now seen corresponding path program 1 times [2018-11-14 18:14:54,046 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:54,047 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:54,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:54,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:54,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 18:14:54,221 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-14 18:14:54,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 18:14:54,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #136#return; {45#true} is VALID [2018-11-14 18:14:54,224 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret18 := main(); {45#true} is VALID [2018-11-14 18:14:54,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {45#true} is VALID [2018-11-14 18:14:54,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 18:14:54,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {46#false} is VALID [2018-11-14 18:14:54,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 18:14:54,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {46#false} is VALID [2018-11-14 18:14:54,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 18:14:54,231 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 18:14:54,231 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:54,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:54,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:14:54,246 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:14:54,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:54,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:14:54,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:54,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:14:54,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:14:54,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:14:54,318 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 18:14:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:54,754 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2018-11-14 18:14:54,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:14:54,755 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:14:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:14:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2018-11-14 18:14:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:14:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2018-11-14 18:14:54,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 114 transitions. [2018-11-14 18:14:55,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:55,482 INFO L225 Difference]: With dead ends: 78 [2018-11-14 18:14:55,483 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 18:14:55,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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 18:14:55,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 18:14:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 18:14:55,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:55,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 18:14:55,540 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 18:14:55,541 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 18:14:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:55,546 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 18:14:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:14:55,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:55,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:55,547 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 18:14:55,548 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 18:14:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:55,553 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 18:14:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:14:55,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:55,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:55,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:55,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:14:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-14 18:14:55,559 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2018-11-14 18:14:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:55,560 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-14 18:14:55,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:14:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:14:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:14:55,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:55,561 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:55,561 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:55,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1039758525, now seen corresponding path program 1 times [2018-11-14 18:14:55,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:55,562 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:55,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:55,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:55,975 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 18:14:56,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:14:56,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:56,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:56,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:56,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-14 18:14:56,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-14 18:14:56,300 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 18:14:56,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:56,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:56,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:56,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:4 [2018-11-14 18:14:56,356 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:14:56,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-14 18:14:56,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {278#true} is VALID [2018-11-14 18:14:56,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-14 18:14:56,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #136#return; {278#true} is VALID [2018-11-14 18:14:56,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret18 := main(); {278#true} is VALID [2018-11-14 18:14:56,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2018-11-14 18:14:56,434 INFO L273 TraceCheckUtils]: 6: Hoare triple {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} assume true; {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2018-11-14 18:14:56,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} assume !(#t~nondet1 != 0bv32);havoc #t~nondet1; {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} is VALID [2018-11-14 18:14:56,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {298#(and (not (= (_ bv0 32) main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base))} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {308#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-14 18:14:56,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {308#(not (= (_ bv0 32) main_~x~0.base))} assume true; {308#(not (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-14 18:14:56,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {308#(not (= (_ bv0 32) main_~x~0.base))} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {279#false} is VALID [2018-11-14 18:14:56,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-14 18:14:56,453 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 18:14:56,453 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:56,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:56,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:14:56,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 18:14:56,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:56,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:14:56,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:56,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:14:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:14:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:14:56,515 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 4 states. [2018-11-14 18:14:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:57,254 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-14 18:14:57,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:14:57,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 18:14:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:14:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2018-11-14 18:14:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:14:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2018-11-14 18:14:57,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2018-11-14 18:14:57,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:57,384 INFO L225 Difference]: With dead ends: 61 [2018-11-14 18:14:57,384 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 18:14:57,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:14:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 18:14:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2018-11-14 18:14:57,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:57,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 36 states. [2018-11-14 18:14:57,409 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 36 states. [2018-11-14 18:14:57,409 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 36 states. [2018-11-14 18:14:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:57,415 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-14 18:14:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-14 18:14:57,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:57,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:57,416 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 57 states. [2018-11-14 18:14:57,416 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 57 states. [2018-11-14 18:14:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:57,420 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-14 18:14:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-14 18:14:57,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:57,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:57,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:57,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:14:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-14 18:14:57,425 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 12 [2018-11-14 18:14:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:57,425 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-14 18:14:57,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:14:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-14 18:14:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:14:57,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:57,426 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:57,427 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:57,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1969300825, now seen corresponding path program 1 times [2018-11-14 18:14:57,428 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:57,428 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:57,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:57,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:57,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {552#true} call ULTIMATE.init(); {552#true} is VALID [2018-11-14 18:14:57,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {552#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {552#true} is VALID [2018-11-14 18:14:57,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {552#true} assume true; {552#true} is VALID [2018-11-14 18:14:57,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {552#true} {552#true} #136#return; {552#true} is VALID [2018-11-14 18:14:57,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {552#true} call #t~ret18 := main(); {552#true} is VALID [2018-11-14 18:14:57,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {552#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1bv32; {572#(= (_ bv1 32) main_~state~0)} is VALID [2018-11-14 18:14:57,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {572#(= (_ bv1 32) main_~state~0)} assume true; {572#(= (_ bv1 32) main_~state~0)} is VALID [2018-11-14 18:14:57,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {572#(= (_ bv1 32) main_~state~0)} assume !!(#t~nondet1 != 0bv32);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, ~bvadd32(4bv32, #t~mem3.offset), 4bv32);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32); {572#(= (_ bv1 32) main_~state~0)} is VALID [2018-11-14 18:14:57,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {572#(= (_ bv1 32) main_~state~0)} assume #t~nondet5 != 0bv32;havoc #t~nondet5; {572#(= (_ bv1 32) main_~state~0)} is VALID [2018-11-14 18:14:57,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {572#(= (_ bv1 32) main_~state~0)} assume !(~state~0 == 1bv32); {553#false} is VALID [2018-11-14 18:14:57,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {553#false} assume !(~state~0 == 2bv32); {553#false} is VALID [2018-11-14 18:14:57,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {553#false} call write~intINTTYPE4(~state~0, ~x~0.base, ~bvadd32(8bv32, ~x~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {553#false} is VALID [2018-11-14 18:14:57,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {553#false} assume true; {553#false} is VALID [2018-11-14 18:14:57,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {553#false} assume !(0bv32 != ~x~0.base || 0bv32 != ~x~0.offset); {553#false} is VALID [2018-11-14 18:14:57,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {553#false} assume !false; {553#false} is VALID [2018-11-14 18:14:57,567 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 18:14:57,567 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:57,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:57,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:14:57,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:14:57,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:57,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:14:57,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:57,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:14:57,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:14:57,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:14:57,618 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 3 states. [2018-11-14 18:14:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:57,908 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-14 18:14:57,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:14:57,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:14:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:14:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-14 18:14:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:14:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-14 18:14:57,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2018-11-14 18:14:58,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:58,099 INFO L225 Difference]: With dead ends: 85 [2018-11-14 18:14:58,100 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 18:14:58,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:14:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 18:14:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2018-11-14 18:14:58,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:58,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 44 states. [2018-11-14 18:14:58,143 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 44 states. [2018-11-14 18:14:58,143 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 44 states. [2018-11-14 18:14:58,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:58,147 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-14 18:14:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-11-14 18:14:58,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:58,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:58,148 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 60 states. [2018-11-14 18:14:58,148 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 60 states. [2018-11-14 18:14:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:58,152 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-14 18:14:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-11-14 18:14:58,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:58,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:58,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:58,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:14:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-14 18:14:58,156 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 15 [2018-11-14 18:14:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:58,156 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-14 18:14:58,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:14:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-14 18:14:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:14:58,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:58,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:58,158 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:58,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:58,159 INFO L82 PathProgramCache]: Analyzing trace with hash 462917072, now seen corresponding path program 1 times [2018-11-14 18:14:58,159 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:58,159 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:58,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 18:14:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 18:14:58,313 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 18:14:58,354 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 18:14:58,354 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 18:14:58,354 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 18:14:58,354 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 18:14:58,355 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:14:58,355 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 18:14:58,355 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 18:14:58,355 WARN L170 areAnnotationChecker]: L1014-7 has no Hoare annotation [2018-11-14 18:14:58,355 WARN L170 areAnnotationChecker]: L1014-7 has no Hoare annotation [2018-11-14 18:14:58,355 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:14:58,356 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:14:58,356 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2018-11-14 18:14:58,356 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2018-11-14 18:14:58,356 WARN L170 areAnnotationChecker]: L994-3 has no Hoare annotation [2018-11-14 18:14:58,356 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2018-11-14 18:14:58,356 WARN L170 areAnnotationChecker]: L1002 has no Hoare annotation [2018-11-14 18:14:58,356 WARN L170 areAnnotationChecker]: L1019-6 has no Hoare annotation [2018-11-14 18:14:58,357 WARN L170 areAnnotationChecker]: L1019-6 has no Hoare annotation [2018-11-14 18:14:58,357 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2018-11-14 18:14:58,357 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2018-11-14 18:14:58,357 WARN L170 areAnnotationChecker]: L1002-1 has no Hoare annotation [2018-11-14 18:14:58,357 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2018-11-14 18:14:58,357 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2018-11-14 18:14:58,357 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2018-11-14 18:14:58,358 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2018-11-14 18:14:58,358 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2018-11-14 18:14:58,358 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2018-11-14 18:14:58,358 WARN L170 areAnnotationChecker]: L1014-6 has no Hoare annotation [2018-11-14 18:14:58,358 WARN L170 areAnnotationChecker]: L1014-6 has no Hoare annotation [2018-11-14 18:14:58,358 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2018-11-14 18:14:58,359 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2018-11-14 18:14:58,359 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2018-11-14 18:14:58,359 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2018-11-14 18:14:58,359 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2018-11-14 18:14:58,359 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2018-11-14 18:14:58,359 WARN L170 areAnnotationChecker]: L1014-1 has no Hoare annotation [2018-11-14 18:14:58,359 WARN L170 areAnnotationChecker]: L1014-1 has no Hoare annotation [2018-11-14 18:14:58,359 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2018-11-14 18:14:58,360 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2018-11-14 18:14:58,360 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2018-11-14 18:14:58,360 WARN L170 areAnnotationChecker]: L1029-4 has no Hoare annotation [2018-11-14 18:14:58,360 WARN L170 areAnnotationChecker]: L1014-2 has no Hoare annotation [2018-11-14 18:14:58,360 WARN L170 areAnnotationChecker]: L1014-2 has no Hoare annotation [2018-11-14 18:14:58,360 WARN L170 areAnnotationChecker]: L1014-4 has no Hoare annotation [2018-11-14 18:14:58,360 WARN L170 areAnnotationChecker]: L1014-4 has no Hoare annotation [2018-11-14 18:14:58,361 WARN L170 areAnnotationChecker]: L1023-8 has no Hoare annotation [2018-11-14 18:14:58,361 WARN L170 areAnnotationChecker]: L1023-8 has no Hoare annotation [2018-11-14 18:14:58,361 WARN L170 areAnnotationChecker]: L1029-1 has no Hoare annotation [2018-11-14 18:14:58,361 WARN L170 areAnnotationChecker]: L1029-5 has no Hoare annotation [2018-11-14 18:14:58,361 WARN L170 areAnnotationChecker]: L1023-1 has no Hoare annotation [2018-11-14 18:14:58,361 WARN L170 areAnnotationChecker]: L1023-1 has no Hoare annotation [2018-11-14 18:14:58,361 WARN L170 areAnnotationChecker]: L1023-9 has no Hoare annotation [2018-11-14 18:14:58,361 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2018-11-14 18:14:58,362 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2018-11-14 18:14:58,362 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:14:58,362 WARN L170 areAnnotationChecker]: L1023-3 has no Hoare annotation [2018-11-14 18:14:58,362 WARN L170 areAnnotationChecker]: L1023-3 has no Hoare annotation [2018-11-14 18:14:58,362 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:14:58,362 WARN L170 areAnnotationChecker]: L1023-4 has no Hoare annotation [2018-11-14 18:14:58,362 WARN L170 areAnnotationChecker]: L1023-4 has no Hoare annotation [2018-11-14 18:14:58,363 WARN L170 areAnnotationChecker]: L1023-6 has no Hoare annotation [2018-11-14 18:14:58,363 WARN L170 areAnnotationChecker]: L1023-6 has no Hoare annotation [2018-11-14 18:14:58,363 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:14:58,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:14:58 BoogieIcfgContainer [2018-11-14 18:14:58,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:14:58,368 INFO L168 Benchmark]: Toolchain (without parser) took 6470.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -473.4 MB). Peak memory consumption was 276.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:58,370 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:14:58,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.1 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:58,371 INFO L168 Benchmark]: Boogie Preprocessor took 103.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:58,372 INFO L168 Benchmark]: RCFGBuilder took 1225.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 64.4 MB). Peak memory consumption was 64.4 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:58,373 INFO L168 Benchmark]: TraceAbstraction took 4459.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 246.9 MB). Peak memory consumption was 246.9 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:58,380 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 677.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.1 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1225.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 64.4 MB). Peak memory consumption was 64.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4459.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 246.9 MB). Peak memory consumption was 246.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1023]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L986] EXPR, FCALL malloc(sizeof(SLL)) [L986] SLL* head = malloc(sizeof(SLL)); [L987] FCALL head->next = head [L988] FCALL head->data = 0 [L990] SLL* x = head; [L991] int state = 1; VAL [head={1:0}, malloc(sizeof(SLL))={1:0}, state=1, x={1:0}] [L994] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL x->data = state [L1018] EXPR, FCALL head->next [L1018] x = head->next [L1019] COND FALSE !(!(((void*)0) != x)) VAL [head={1:0}, malloc(sizeof(SLL))={1:0}, state=1, x={1:0}] [L1019] COND FALSE !(0) VAL [head={1:0}, malloc(sizeof(SLL))={1:0}, state=1, x={1:0}] [L1021] EXPR, FCALL x->data VAL [head={1:0}, malloc(sizeof(SLL))={1:0}, state=1, x={1:0}, x->data=1] [L1021] COND TRUE x->data != 0 [L1023] EXPR, FCALL x->next [L1023] EXPR, FCALL x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data [L1023] EXPR, FCALL x->data [L1023] EXPR, FCALL x->next [L1023] EXPR, FCALL x->next->data [L1023] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={1:0}, malloc(sizeof(SLL))={1:0}, state=1, x={1:0}, x->data=1, x->next={1:0}, x->next={1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1023] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1023] __VERIFIER_error() VAL [head={1:0}, malloc(sizeof(SLL))={1:0}, state=1, x={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 3 error locations. UNSAFE Result, 4.3s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 108 SDtfs, 73 SDslu, 79 SDs, 0 SdLazy, 35 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 37 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 958 SizeOfPredicates, 4 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...