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/list-simple/dll2c_prepend_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:19:11,629 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:19:11,631 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:19:11,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:19:11,653 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:19:11,654 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:19:11,656 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:19:11,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:19:11,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:19:11,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:19:11,667 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:19:11,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:19:11,669 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:19:11,671 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:19:11,672 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:19:11,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:19:11,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:19:11,675 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:19:11,678 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:19:11,681 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:19:11,682 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:19:11,683 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:19:11,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:19:11,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:19:11,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:19:11,688 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:19:11,689 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:19:11,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:19:11,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:19:11,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:19:11,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:19:11,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:19:11,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:19:11,697 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:19:11,698 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:19:11,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:19:11,700 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:19:11,723 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:19:11,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:19:11,724 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:19:11,724 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:19:11,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:19:11,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:19:11,725 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:19:11,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:19:11,726 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:19:11,726 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:19:11,726 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:19:11,726 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:19:11,726 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:19:11,726 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:19:11,727 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:19:11,727 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:19:11,727 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:19:11,727 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:19:11,727 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:19:11,728 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:19:11,728 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:19:11,728 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:19:11,728 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:19:11,728 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:19:11,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:19:11,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:19:11,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:19:11,729 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:19:11,729 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:19:11,730 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:19:11,730 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:19:11,730 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:19:11,730 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:19:11,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:19:11,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:19:11,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:19:11,802 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:19:11,802 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:19:11,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:19:11,878 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489fde49e/222b22733e334b40979fde86fd641875/FLAG1b0c0abaa [2018-11-14 18:19:12,461 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:19:12,462 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:19:12,476 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489fde49e/222b22733e334b40979fde86fd641875/FLAG1b0c0abaa [2018-11-14 18:19:12,490 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489fde49e/222b22733e334b40979fde86fd641875 [2018-11-14 18:19:12,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:19:12,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:19:12,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:19:12,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:19:12,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:19:12,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:19:12" (1/1) ... [2018-11-14 18:19:12,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78871992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:12, skipping insertion in model container [2018-11-14 18:19:12,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:19:12" (1/1) ... [2018-11-14 18:19:12,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:19:12,567 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:19:13,081 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:19:13,100 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:19:13,190 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:19:13,356 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:19:13,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:13 WrapperNode [2018-11-14 18:19:13,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:19:13,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:19:13,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:19:13,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:19:13,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:13" (1/1) ... [2018-11-14 18:19:13,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:13" (1/1) ... [2018-11-14 18:19:13,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:13" (1/1) ... [2018-11-14 18:19:13,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:13" (1/1) ... [2018-11-14 18:19:13,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:13" (1/1) ... [2018-11-14 18:19:13,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:13" (1/1) ... [2018-11-14 18:19:13,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:13" (1/1) ... [2018-11-14 18:19:13,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:19:13,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:19:13,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:19:13,469 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:19:13,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:13" (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:19:13,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:19:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:19:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:19:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:19:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 18:19:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 18:19:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-14 18:19:13,538 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-14 18:19:13,538 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_prepend [2018-11-14 18:19:13,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:19:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:19:13,538 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:19:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:19:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:19:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:19:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:19:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:19:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:19:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:19:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:19:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:19:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:19:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:19:13,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:19:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:19:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:19:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:19:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:19:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:19:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:19:13,541 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:19:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:19:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:19:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:19:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:19:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:19:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:19:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:19:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:19:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:19:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:19:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:19:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:19:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:19:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:19:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:19:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:19:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:19:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:19:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:19:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:19:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:19:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:19:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:19:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:19:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:19:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:19:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:19:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:19:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:19:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:19:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:19:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:19:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:19:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:19:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:19:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:19:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:19:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:19:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:19:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:19:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:19:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:19:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:19:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:19:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:19:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:19:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:19:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:19:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:19:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:19:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:19:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:19:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:19:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:19:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:19:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:19:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:19:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:19:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:19:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:19:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:19:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:19:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:19:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:19:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:19:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:19:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:19:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:19:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:19:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:19:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:19:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:19:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:19:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:19:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:19:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:19:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:19:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:19:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:19:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:19:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:19:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:19:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:19:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:19:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:19:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 18:19:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:19:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:19:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:19:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-14 18:19:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-14 18:19:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:19:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:19:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_prepend [2018-11-14 18:19:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:19:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:19:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:19:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:19:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:19:15,076 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:19:15,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:19:15 BoogieIcfgContainer [2018-11-14 18:19:15,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:19:15,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:19:15,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:19:15,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:19:15,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:19:12" (1/3) ... [2018-11-14 18:19:15,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28033166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:19:15, skipping insertion in model container [2018-11-14 18:19:15,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:19:13" (2/3) ... [2018-11-14 18:19:15,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28033166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:19:15, skipping insertion in model container [2018-11-14 18:19:15,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:19:15" (3/3) ... [2018-11-14 18:19:15,086 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:19:15,094 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:19:15,103 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:19:15,118 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:19:15,150 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:19:15,151 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:19:15,151 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:19:15,151 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:19:15,151 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:19:15,152 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:19:15,152 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:19:15,152 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:19:15,152 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:19:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-14 18:19:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:19:15,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:19:15,180 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, 1, 1, 1, 1] [2018-11-14 18:19:15,183 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:19:15,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:19:15,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2055885540, now seen corresponding path program 1 times [2018-11-14 18:19:15,195 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:19:15,196 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:19:15,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:19:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:15,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:19:15,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {59#true} is VALID [2018-11-14 18:19:15,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {59#true} is VALID [2018-11-14 18:19:15,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 18:19:15,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {59#true} {59#true} #129#return; {59#true} is VALID [2018-11-14 18:19:15,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {59#true} call #t~ret20 := main(); {59#true} is VALID [2018-11-14 18:19:15,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {59#true} is VALID [2018-11-14 18:19:15,834 INFO L256 TraceCheckUtils]: 6: Hoare triple {59#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {59#true} is VALID [2018-11-14 18:19:15,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#true} ~len := #in~len;~data := #in~data; {59#true} is VALID [2018-11-14 18:19:15,835 INFO L256 TraceCheckUtils]: 8: Hoare triple {59#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {59#true} is VALID [2018-11-14 18:19:15,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {59#true} is VALID [2018-11-14 18:19:15,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {59#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {59#true} is VALID [2018-11-14 18:19:15,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {59#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {59#true} is VALID [2018-11-14 18:19:15,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 18:19:15,837 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {59#true} {59#true} #117#return; {59#true} is VALID [2018-11-14 18:19:15,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {59#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {59#true} is VALID [2018-11-14 18:19:15,853 INFO L273 TraceCheckUtils]: 15: Hoare triple {59#true} assume !true; {60#false} is VALID [2018-11-14 18:19:15,854 INFO L273 TraceCheckUtils]: 16: Hoare triple {60#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {60#false} is VALID [2018-11-14 18:19:15,854 INFO L273 TraceCheckUtils]: 17: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-14 18:19:15,854 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {60#false} {59#true} #123#return; {60#false} is VALID [2018-11-14 18:19:15,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {60#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {60#false} is VALID [2018-11-14 18:19:15,855 INFO L256 TraceCheckUtils]: 20: Hoare triple {60#false} call dll_circular_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {60#false} is VALID [2018-11-14 18:19:15,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {60#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {60#false} is VALID [2018-11-14 18:19:15,856 INFO L256 TraceCheckUtils]: 22: Hoare triple {60#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {60#false} is VALID [2018-11-14 18:19:15,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {60#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {60#false} is VALID [2018-11-14 18:19:15,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {60#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {60#false} is VALID [2018-11-14 18:19:15,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {60#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {60#false} is VALID [2018-11-14 18:19:15,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-14 18:19:15,857 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {60#false} {60#false} #133#return; {60#false} is VALID [2018-11-14 18:19:15,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {60#false} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {60#false} is VALID [2018-11-14 18:19:15,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {60#false} assume !(0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~old_head~0.base, ~old_head~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~old_head~0.base, ~old_head~0.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~old_head~0.base, ~bvadd32(4bv32, ~old_head~0.offset), 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~last~1.base, ~last~1.offset, 4bv32);call write~$Pointer$(~last~1.base, ~last~1.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32); {60#false} is VALID [2018-11-14 18:19:15,859 INFO L273 TraceCheckUtils]: 30: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-14 18:19:15,859 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {60#false} {60#false} #125#return; {60#false} is VALID [2018-11-14 18:19:15,860 INFO L273 TraceCheckUtils]: 32: Hoare triple {60#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {60#false} is VALID [2018-11-14 18:19:15,860 INFO L273 TraceCheckUtils]: 33: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 18:19:15,861 INFO L273 TraceCheckUtils]: 34: Hoare triple {60#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {60#false} is VALID [2018-11-14 18:19:15,861 INFO L273 TraceCheckUtils]: 35: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-11-14 18:19:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:19:15,876 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:19:15,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:19:15,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:19:15,891 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-14 18:19:15,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:19:15,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:19:16,057 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 18:19:16,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:19:16,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:19:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:19:16,068 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-14 18:19:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:16,607 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2018-11-14 18:19:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:19:16,608 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-14 18:19:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:19:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:19:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2018-11-14 18:19:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:19:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2018-11-14 18:19:16,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 116 transitions. [2018-11-14 18:19:17,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:19:17,062 INFO L225 Difference]: With dead ends: 96 [2018-11-14 18:19:17,062 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 18:19:17,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:19:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 18:19:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 18:19:17,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:19:17,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 18:19:17,121 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 18:19:17,122 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 18:19:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:17,128 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-14 18:19:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-14 18:19:17,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:19:17,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:19:17,130 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 18:19:17,130 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 18:19:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:17,136 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-14 18:19:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-14 18:19:17,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:19:17,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:19:17,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:19:17,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:19:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 18:19:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-14 18:19:17,144 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 36 [2018-11-14 18:19:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:19:17,144 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-14 18:19:17,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:19:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-14 18:19:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 18:19:17,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:19:17,147 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, 1, 1, 1, 1, 1] [2018-11-14 18:19:17,147 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:19:17,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:19:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1841936862, now seen corresponding path program 1 times [2018-11-14 18:19:17,149 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:19:17,149 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:19:17,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:19:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:17,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:19:17,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {430#true} call ULTIMATE.init(); {430#true} is VALID [2018-11-14 18:19:17,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {430#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {430#true} is VALID [2018-11-14 18:19:17,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {430#true} assume true; {430#true} is VALID [2018-11-14 18:19:17,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} #129#return; {430#true} is VALID [2018-11-14 18:19:17,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {430#true} call #t~ret20 := main(); {430#true} is VALID [2018-11-14 18:19:17,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {430#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {450#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:19:17,421 INFO L256 TraceCheckUtils]: 6: Hoare triple {450#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {430#true} is VALID [2018-11-14 18:19:17,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {430#true} ~len := #in~len;~data := #in~data; {457#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 18:19:17,426 INFO L256 TraceCheckUtils]: 8: Hoare triple {457#(= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {430#true} is VALID [2018-11-14 18:19:17,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {430#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {430#true} is VALID [2018-11-14 18:19:17,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {430#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {430#true} is VALID [2018-11-14 18:19:17,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {430#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {430#true} is VALID [2018-11-14 18:19:17,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {430#true} assume true; {430#true} is VALID [2018-11-14 18:19:17,429 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {430#true} {457#(= |dll_circular_create_#in~len| dll_circular_create_~len)} #117#return; {457#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 18:19:17,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {457#(= |dll_circular_create_#in~len| dll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {457#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 18:19:17,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {457#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume true; {457#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 18:19:17,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {457#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {485#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 18:19:17,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {485#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {485#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 18:19:17,478 INFO L273 TraceCheckUtils]: 18: Hoare triple {485#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} assume true; {485#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 18:19:17,488 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {485#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} {450#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #123#return; {431#false} is VALID [2018-11-14 18:19:17,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {431#false} call write~$Pointer$(#t~ret13.base, #t~ret13.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret13.base, #t~ret13.offset; {431#false} is VALID [2018-11-14 18:19:17,488 INFO L256 TraceCheckUtils]: 21: Hoare triple {431#false} call dll_circular_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {431#false} is VALID [2018-11-14 18:19:17,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {431#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {431#false} is VALID [2018-11-14 18:19:17,489 INFO L256 TraceCheckUtils]: 23: Hoare triple {431#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {431#false} is VALID [2018-11-14 18:19:17,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {431#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {431#false} is VALID [2018-11-14 18:19:17,490 INFO L273 TraceCheckUtils]: 25: Hoare triple {431#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {431#false} is VALID [2018-11-14 18:19:17,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {431#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {431#false} is VALID [2018-11-14 18:19:17,490 INFO L273 TraceCheckUtils]: 27: Hoare triple {431#false} assume true; {431#false} is VALID [2018-11-14 18:19:17,490 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {431#false} {431#false} #133#return; {431#false} is VALID [2018-11-14 18:19:17,491 INFO L273 TraceCheckUtils]: 29: Hoare triple {431#false} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {431#false} is VALID [2018-11-14 18:19:17,491 INFO L273 TraceCheckUtils]: 30: Hoare triple {431#false} assume !(0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset);havoc #t~mem9.base, #t~mem9.offset;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(#t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset), 4bv32);~last~1.base, ~last~1.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~old_head~0.base, ~old_head~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~old_head~0.base, ~old_head~0.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~old_head~0.base, ~bvadd32(4bv32, ~old_head~0.offset), 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~last~1.base, ~last~1.offset, 4bv32);call write~$Pointer$(~last~1.base, ~last~1.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32); {431#false} is VALID [2018-11-14 18:19:17,491 INFO L273 TraceCheckUtils]: 31: Hoare triple {431#false} assume true; {431#false} is VALID [2018-11-14 18:19:17,492 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {431#false} {431#false} #125#return; {431#false} is VALID [2018-11-14 18:19:17,492 INFO L273 TraceCheckUtils]: 33: Hoare triple {431#false} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset;~count~0 := 0bv32; {431#false} is VALID [2018-11-14 18:19:17,492 INFO L273 TraceCheckUtils]: 34: Hoare triple {431#false} assume true;call #t~mem16 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(8bv32, ~ptr~0.offset), 4bv32); {431#false} is VALID [2018-11-14 18:19:17,493 INFO L273 TraceCheckUtils]: 35: Hoare triple {431#false} assume ~data~0 != #t~mem16;havoc #t~mem16; {431#false} is VALID [2018-11-14 18:19:17,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {431#false} assume !false; {431#false} is VALID [2018-11-14 18:19:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:19:17,496 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:19:17,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:19:17,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:19:17,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 18:19:17,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:19:17,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:19:17,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:19:17,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:19:17,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:19:17,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:19:17,599 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 5 states. [2018-11-14 18:19:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:19,079 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-14 18:19:19,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:19:19,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 18:19:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:19:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:19:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-14 18:19:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:19:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2018-11-14 18:19:19,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2018-11-14 18:19:19,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:19:19,275 INFO L225 Difference]: With dead ends: 70 [2018-11-14 18:19:19,275 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 18:19:19,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:19:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 18:19:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-14 18:19:19,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:19:19,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2018-11-14 18:19:19,296 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2018-11-14 18:19:19,296 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2018-11-14 18:19:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:19,301 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-14 18:19:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-14 18:19:19,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:19:19,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:19:19,302 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2018-11-14 18:19:19,302 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2018-11-14 18:19:19,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:19:19,307 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-14 18:19:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-14 18:19:19,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:19:19,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:19:19,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:19:19,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:19:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:19:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-14 18:19:19,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 37 [2018-11-14 18:19:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:19:19,313 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-14 18:19:19,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:19:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 18:19:19,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 18:19:19,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:19:19,315 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:19:19,315 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:19:19,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:19:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1919565884, now seen corresponding path program 1 times [2018-11-14 18:19:19,316 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:19:19,316 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:19:19,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:19:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:19:19,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:19:19,709 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 18:19:19,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:19,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:19,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-14 18:19:19,768 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:20,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-14 18:19:20,615 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 18:19:20,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,652 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:20,667 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 21 treesize of output 22 [2018-11-14 18:19:20,677 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 10 treesize of output 9 [2018-11-14 18:19:20,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:20,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:19:20,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:57 [2018-11-14 18:19:20,800 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:22,950 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-14 18:19:23,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:23,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:23,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:19:23,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 60 [2018-11-14 18:19:23,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-11-14 18:19:23,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:23,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:23,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:19:23,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:71 [2018-11-14 18:19:23,268 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:19:23,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:19:23,727 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 18:19:23,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:23,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:23,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-11-14 18:19:23,873 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:19:23,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:23,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:23,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:19:23,969 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:103 [2018-11-14 18:19:24,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 18:19:24,514 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 10 treesize of output 9 [2018-11-14 18:19:24,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:19:24,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-11-14 18:19:25,638 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-14 18:20:24,010 WARN L179 SmtUtils]: Spent 9.47 s on a formula simplification that was a NOOP. DAG size: 126